5831 search results - page 27 / 1167 » Distributed Dynamic Backtracking |
SARA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. If a CSP instance has no solution, it contains a smaller unsolvable subproblem that makes unsolvable the whole problem. When solving such instance, instead of just return...
CPAIOR
2005
Springer
14 years 2 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
KBSE
2002
IEEE
14 years 1 months ago
2002
IEEE
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
MST
2000
13 years 8 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we review two existing static load balancing schemes based on M/M/1 queues. We then use these schemes to propose two dynamic load balancing schemes for multi-user (...