Sciweavers

14649 search results - page 213 / 2930
» Principles of problem solving
Sort
View
172
Voted
SIAMCOMP
2008
133views more  SIAMCOMP 2008»
15 years 6 months ago
A Deterministic Subexponential Algorithm for Solving Parity Games
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
Marcin Jurdzinski, Mike Paterson, Uri Zwick
AIA
2006
15 years 7 months ago
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
Benno Stein, Oliver Niggemann, Theodor Lettmann
154
Voted
MP
2006
106views more  MP 2006»
15 years 6 months ago
Worst-case distribution analysis of stochastic programs
We show that for even quasi-concave objective functions the worst-case distribution, with respect to a family of unimodal distributions, of a stochastic programming problem is a u...
Alexander Shapiro
EOR
2006
97views more  EOR 2006»
15 years 6 months ago
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Co...
Andrew Lim, Brian Rodrigues, X. Zhang
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
15 years 4 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...