Sciweavers

266 search results - page 50 / 54
» Graphs with Bounded Induced Distance
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
Scott C.-H. Huang, Peng-Jun Wan, Xiaohua Jia, Hong...
ROBOCOMM
2007
IEEE
14 years 2 months ago
Decentralized swarm aggregation with static communication links
— The objective of this paper is decentralized swarm aggregation with collision avoidance. Specifically, each agent is assigned with a control law which is the sum of two elemen...
Dimos V. Dimarogonas, Kostas J. Kyriakopoulos
CDC
2009
IEEE
172views Control Systems» more  CDC 2009»
14 years 13 days ago
A dynamic boundary guarding problem with translating targets
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
Stephen L. Smith, Shaunak Dattaprasad Bopardikar, ...
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 9 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
ECAI
2008
Springer
13 years 9 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...