Sciweavers

9119 search results - page 188 / 1824
» A Simultaneous Search Problem
Sort
View
ESA
2006
Springer
96views Algorithms» more  ESA 2006»
15 years 10 months ago
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
SAC
2005
ACM
16 years 1 days ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
SAT
2004
Springer
88views Hardware» more  SAT 2004»
15 years 12 months ago
Improving First-order Model Searching by Propositional Reasoning and Lemma Learning
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
Zhuo Huang, Hantao Zhang, Jian Zhang
ICML
2003
IEEE
16 years 7 months ago
Stochastic Local Search in k-Term DNF Learning
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
Stefan Kramer, Ulrich Rückert
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 6 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak