1300 search results - page 177 / 260 » Constraint satisfaction problems and global cardinality cons... |
ICTAI
2007
IEEE
15 years 4 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
CPC
2006
14 years 9 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
105
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
IUI
2004
ACM
15 years 3 months ago
2004
ACM
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
101
click to vote
AAAI
2006
14 years 11 months ago
2006
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...