To purchase hard copies of this book, please email:
orders@intechopen.com
Share this page
This book is indexed in
Computer and Information Science » Numerical Analysis and Scientific Computing
Greedy Algorithms
Edited by Witold Bednorz, ISBN 978-953-7619-27-5, Hard cover, 586 pages, Publisher: InTech, Chapters published November 01, 2008 under CC BY-NC-SA 3.0 license
DOI: 10.5772/92
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remarks or theorems.
- Chapter 1
A Greedy Algorithm with Forward-Looking Strategy - Chapter 2
A Greedy Scheme for Designing Delay Monitoring Systems of IP Networks - Chapter 3
A Multilevel Greedy Algorithm for the Satisfiability Problem - Chapter 4
A Multi-start Local Search Approach to the Multiple Container Loading Problem - Chapter 5
A Partition-Based Suffix Tree Construction and Its Applications - Chapter 6
Bayesian Framework for State Estimation and Robot Behaviour Selection in Dynamic Environments - Chapter 7
Efficient Multi-User Parallel Greedy Bit-Loading Algorithm with Fairness Control For DMT Systems - Chapter 8
Energy Efficient Greedy Approach for Sensor Networks - Chapter 9
Enhancing Greedy Policy Techniques for Complex Cost-Sensitive Problems - Chapter 10
Greedy Algorithm: Exploring Potential of Link Adaptation Technique in Wideband Wireless Communication Systems - Chapter 11
Greedy Algorithms for Mapping onto a Coarse-grained Reconfigurable Fabric - Chapter 12
Greedy Algorithms for Spectrum Management in OFDM Cognitive Systems - Applications to Video Streaming and Wireless Sensor Networks - Chapter 13
Greedy Algorithms in Survivable Optical Networks - Chapter 14
Greedy Algorithms to Determine Stable Paths and Trees in Mobile Ad hoc Networks - Chapter 15
Greedy Anti-Void Forwarding Strategies for Wireless Sensor Networks - Chapter 16
Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems - Chapter 17
Greedy Methods in Plume Detection, Localization and Tracking - Chapter 18
Greedy Type Bases in Banach Spaces - Chapter 19
Hardware-oriented Ant Colony Optimization Considering Intensification and Diversification - Chapter 20
Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem and Its Application to Genetic Algorithm Development - Chapter 21
Opportunistic Scheduling for Next Generation Wireless Local Area Networks - Chapter 22
Parallel Greedy Approximation on Large-Scale Combinatorial Auctions - Chapter 23
Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm - Chapter 24
Provably-Efficient Online Adaptive Scheduling of Parallel Jobs Based on Simple Greedy Rules - Chapter 25
Quasi-Concave Functions and Greedy Algorithms - Chapter 26
Semantic Matchmaking Algorithms - Chapter 27
Solving Inter-AS Bandwidth Guaranteed Provisioning Problems with Greedy Heuristics - Chapter 28
Solving the High School Scheduling Problem Modelled with Constraints Satisfaction Using Hybrid Heuristic Algorithms - Chapter 29
Toward Improving b-Coloring Based Clustering Using a Greedy re-Coloring Algorithm - Chapter 30
WDM Optical Networks Planning Using Greedy Algorithms
