49 search results - page 3 / 10 » Clearing Restarting Automata |
LATA
2010
Springer
13 years 9 months ago
2010
Springer
FLAIRS
2007
14 years 1 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
VLDB
2007
ACM
14 years 11 months ago
2007
ACM
Long running decision support queries can be resource intensive and often lead to resource contention in data warehousing systems. Today, the only real option available to the DBA...
CP
2008
Springer
14 years 19 days ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
FLAIRS
2007
14 years 1 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...