Sciweavers

14158 search results - page 194 / 2832
» Generalized switch-setting problems
Sort
View
152
Voted
FOCS
1999
IEEE
15 years 7 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
122
Voted
TAPSOFT
1997
Springer
15 years 7 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
108
Voted
SIAMSC
2008
165views more  SIAMSC 2008»
15 years 3 months ago
Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
Kristian Bredies, Dirk A. Lorenz
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
15 years 9 months ago
A generator for hierarchical problems
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
MFCS
2009
Springer
15 years 10 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...