Sciweavers

172 search results - page 33 / 35
» Planar Graphs with Topological Constraints
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
Gil Zussman, Andrew Brzezinski, Eytan Modiano
INFOCOM
2008
IEEE
14 years 2 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...
IJRR
2011
159views more  IJRR 2011»
13 years 3 months ago
Visual-inertial navigation, mapping and localization: A scalable real-time causal approach
We present a model to estimate motion from monocular visual and inertial measurements. We analyze the model and characterize the conditions under which its state is observable, an...
Eagle Jones, Stefano Soatto
JAIR
2006
90views more  JAIR 2006»
13 years 8 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
GLOBECOM
2010
IEEE
13 years 6 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun