2109 search results - page 278 / 422 » Solving Necklace Constraint Problems |
133
Voted
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
135
Voted
KBSE
2002
IEEE
15 years 10 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...
128
click to vote
AGENTS
2000
Springer
15 years 9 months ago
2000
Springer
Many applied problems in domains such as military operations, manufacturing, and logistics require that entities change location under certain constraints. These problems are trad...
121
click to vote
REST
2010
ACM
15 years 9 months ago
2010
ACM
Traditionally, distributed computing problems have been solved by partitioning data into chunks able to be handled by commodity hardware. Such partitioning is not possible in case...
182
Voted
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...