88 search results - page 5 / 18 » Solving Non-Boolean Satisfiability Problems with Stochastic ... |
LION
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
CONSTRAINTS
2007
13 years 9 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
JAIR
2000
13 years 9 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
FLAIRS
2004
13 years 11 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...