Sciweavers

68 search results - page 12 / 14
» A Reach and Bound algorithm for acyclic dynamic-programming ...
Sort
View
AI
2010
Springer
13 years 5 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
APPROX
2009
Springer
105views Algorithms» more  APPROX 2009»
13 years 3 months ago
Real-Time Message Routing and Scheduling
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
Ronald Koch, Britta Peis, Martin Skutella, Andreas...
TMC
2010
210views more  TMC 2010»
13 years 4 months ago
Exploiting Reactive Mobility for Collaborative Target Detection in Wireless Sensor Networks
—Recent years have witnessed the deployments of wireless sensor networks in a class of mission-critical applications such as object detection and tracking. These applications oft...
Rui Tan, Guoliang Xing, Jianping Wang, Hing-Cheung...
MOBICOM
2009
ACM
14 years 8 days ago
Mobility increases the connectivity of K-hop clustered wireless networks
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
Qingsi Wang, Xinbing Wang, Xiaojun Lin
SPAA
2004
ACM
13 years 11 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt