Sciweavers

5138 search results - page 11 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
IJCAI
2001
13 years 11 months ago
On Market-Inspired Approaches to Propositional Satisfiability
We describe two market-inspired approaches to propositional satisfiability. Whereas a previous market-inspired approach exhibited extremely slow performance, we find that variatio...
William E. Walsh, Makoto Yokoo, Katsutoshi Hirayam...
JSAT
2006
114views more  JSAT 2006»
13 years 9 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
CSL
2004
Springer
13 years 9 months ago
Arc minimization in finite-state decoding graphs with cross-word acoustic context
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
François Yvon, Geoffrey Zweig, George Saon
JUCS
2010
117views more  JUCS 2010»
13 years 8 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...