405 search results - page 60 / 81 » On the Complexity of Global Constraint Satisfaction |
TCS
2008
14 years 11 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
RTAS
2010
IEEE
14 years 9 months ago
2010
IEEE
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
ATAL
2006
Springer
15 years 2 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
78
Voted
TOG
2008
14 years 11 months ago
2008
This paper presents a new quadrangulation algorithm, extending the spectral surface quadrangulation approach where the coarse quadrangular structure is derived from the Morse-Smal...
104
click to vote
AAAI
2011
13 years 11 months ago
2011
In environmental and natural resource planning domains actions are taken at a large number of locations over multiple time periods. These problems have enormous state and action s...