Sciweavers

1529 search results - page 14 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
121
Voted
EOR
2006
91views more  EOR 2006»
15 years 3 months ago
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
A. Miguel Gomes, José F. Oliveira
143
Voted
CP
2005
Springer
15 years 9 months ago
AND/OR Branch-and-Bound for Solving Mixed 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
138
Voted
ICDAR
2009
IEEE
15 years 1 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
154
Voted
TOPNOC
2010
14 years 10 months ago
Search-Order Independent State Caching
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
Sami Evangelista, Lars Michael Kristensen
ICML
2007
IEEE
16 years 4 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern