Sciweavers

523 search results - page 100 / 105
» Improved Approximation Algorithms for Maximum Graph Partitio...
Sort
View
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
INFOCOM
2010
IEEE
13 years 6 months ago
Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model
—Energy conservation is drawing increasing attention in data networking. One school of thought believes that a dominant amount of energy saving comes from turning off network ele...
Matthew Andrews, Antonio Fernández, Lisa Zh...
INFOCOM
2007
IEEE
14 years 1 months ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
APCHI
2008
IEEE
14 years 2 months ago
On Generating Backbone Trees through Robust Multi-hop Clusters in Wireless Sensor Networks
Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless...
Inyoung Shin, Moonseong Kim, Hyunseung Choo
AAAI
2010
13 years 9 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting