Sciweavers

2343 search results - page 78 / 469
» Visual-Concept Search Solved
Sort
View
COR
2010
121views more  COR 2010»
15 years 4 months ago
Parallel machine scheduling with precedence constraints and setup times
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
Bernat Gacias, Christian Artigues, Pierre Lopez
KI
2008
Springer
15 years 4 months ago
Partial Symbolic Pattern Databases for Optimal Sequential Planning
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
Stefan Edelkamp, Peter Kissmann
IPL
2000
82views more  IPL 2000»
15 years 4 months ago
Estimating the number of vertices of a polyhedron
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
David Avis, Luc Devroye
136
Voted
PVM
2004
Springer
15 years 9 months ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
FLAIRS
2004
15 years 5 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever