4524 search results - page 290 / 905 » The Complexity of Global Constraints |
204
click to vote
OPODIS
2007
15 years 8 months ago
2007
This report describes a necessary and suļ¬cient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
212
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally efļ¬...
343
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
175
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
āConstraint satisfaction problems (CSPs) widely occur in artiļ¬cial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
203
click to vote
ESOP
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. We show how to formalise a constraint-based data ļ¬ow analysis in the speciļ¬cation language of the Coq proof assistant. This involves deļ¬ning a dependent type of lat...