Sciweavers

980 search results - page 122 / 196
» Decentralized Constraint Satisfaction
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 10 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
ATAL
2008
Springer
13 years 11 months ago
Sensing-based shape formation on modular multi-robot systems: a theoretical study
This paper presents a theoretical study of decentralized control for sensing-based shape formation on modular multirobot systems, where the desired shape is specified in terms of ...
Chih-Han Yu, Radhika Nagpal
CP
2003
Springer
14 years 2 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano
ASPDAC
2007
ACM
103views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Slack-based Bus Arbitration Scheme for Soft Real-time Constrained Embedded Systems
- We present a bus arbitration scheme for soft real-time constrained embedded systems. Some masters in such systems are required to complete their work for given timing constraints...
Minje Jun, Kwanhu Bang, Hyuk-Jun Lee, Naehyuck Cha...
CP
2008
Springer
13 years 11 months ago
Solving a Telecommunications Feature Subscription Configuration Problem
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...