344 search results - page 9 / 69 » The Santa Claus problem |
NLPRS
2001
Springer
14 years 1 months ago
2001
Springer
This research focuses on analysis of the grammatical functions between an adnoun clause and a noun phrase in Korean. The key task is to determine the relation between two constitu...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
CORR
2011
Springer
13 years 10 days ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
ILP
1998
Springer
14 years 24 days ago
1998
Springer
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...