Sciweavers

4524 search results - page 36 / 905
» The Complexity of Global Constraints
Sort
View
COR
2006
79views more  COR 2006»
15 years 15 days ago
Sweep synchronization as a global propagation mechanism
This paper presents a new generic filtering algorithm which simultaneously considers n conjunctions of constraints as well as those constraints mentioning some variables Yk of the...
Nicolas Beldiceanu, Mats Carlsson, Sven Thiel
ICC
2007
IEEE
139views Communications» more  ICC 2007»
15 years 6 months ago
A Distributed Estimation Algorithm for Tracking over Wireless Sensor Networks
—A new distributed estimation algorithm for tracking using a wireless sensor network is presented. We investigate how to track a time varying signal, noisily sensed by the nodes ...
Alberto Speranzon, Carlo Fischione, Karl Henrik Jo...
104
Voted
CP
2005
Springer
15 years 6 months ago
Bounds of Graph Characteristics
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
Nicolas Beldiceanu, Thierry Petit, Guillaume Rocha...
TCS
2008
15 years 11 days ago
Approximate GCDs of polynomials and sparse SOS relaxations
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 ...
Bin Li, Jiawang Nie, Lihong Zhi
RTAS
2010
IEEE
14 years 11 months ago
Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
Cong Liu, James H. Anderson