Sciweavers

1529 search results - page 2 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
CPAIOR
2006
Springer
13 years 9 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
COR
2006
92views more  COR 2006»
13 years 5 months ago
Variable neighborhood search for the linear ordering problem
Carlos G. García-González, Dionisio ...
ICTAI
1999
IEEE
13 years 9 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
CGO
2006
IEEE
13 years 11 months ago
Exhaustive Optimization Phase Order Space Exploration
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson, ...