Sciweavers

2743 search results - page 355 / 549
» Minimization of an M-convex Function
Sort
View
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
15 years 11 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 11 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
CPAIOR
2004
Springer
15 years 11 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel
CPM
2004
Springer
84views Combinatorics» more  CPM 2004»
15 years 11 months ago
Small Phylogeny Problem: Character Evolution Trees
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
15 years 11 months ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens