Sciweavers

10051 search results - page 1364 / 2011
» A Dynamic Separator Algorithm
Sort
View
AAAI
2012
13 years 9 months ago
Advances in Lifted Importance Sampling
We consider lifted importance sampling (LIS), a previously proposed approximate inference algorithm for statistical relational learning (SRL) models. LIS achieves substantial vari...
Vibhav Gogate, Abhay Kumar Jha, Deepak Venugopal
195
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
On Optimal MAC Scheduling With Physical Interference
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
PODC
2004
ACM
16 years 18 days ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
EMSOFT
2004
Springer
16 years 17 days ago
Using resource reservation techniques for power-aware scheduling
Minimizing energy consumption is an important issue in the design of real-time embedded systems. As many embedded systems are powered by rechargeable batteries, the goal is to ext...
Claudio Scordino, Giuseppe Lipari
MOBICOM
2003
ACM
16 years 13 days ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
« Prev « First page 1364 / 2011 Last » Next »