Sciweavers

305 search results - page 8 / 61
» Randomization for Multi-agent Constraint Optimization
Sort
View
KI
2001
Springer
14 years 5 days ago
Constraint-Based Optimization of Priority Schemes for Decoupled Path Planning Techniques
Abstract Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
ICIP
2006
IEEE
14 years 1 months ago
Discontinuity-Adaptive De-Interlacing Scheme Using Markov Random Field Model
— In this paper, a de-interlacing algorithm to find the optimal deinterlaced results given accuracy-limited motion information is proposed. The de-interlacing process is formula...
Min Li, Truong Q. Nguyen
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 2 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
INFOCOM
2010
IEEE
13 years 6 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis
CP
1999
Springer
14 years 22 hour ago
Optimal Distributed Arc-Consistency
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
Youssef Hamadi