Sciweavers

3406 search results - page 28 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
FOCS
2006
IEEE
14 years 2 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
ATAL
2008
Springer
13 years 10 months ago
Cooperative search for optimizing pipeline operations
We present an application of a multi-agent cooperative search approach to the problem of optimizing gas pipeline operations, i.e. finding control parameters for a gas transmission...
T. Mora, Abu B. Sesay, Jörg Denzinger, Hossei...
EVOW
2008
Springer
13 years 9 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...
AAAI
2008
13 years 10 months ago
Minimizing Disk I/O in Two-Bit Breadth-First Search
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
Richard E. Korf