Sciweavers

3708 search results - page 195 / 742
» Approximating Betweenness Centrality
Sort
View
SASO
2008
IEEE
16 years 15 days ago
Using Global Information for Load Balancing in DHTs
Distributed Hash Tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only...
Mikael Högqvist, Seif Haridi, Nico Kruber, Al...
INFOCOM
2007
IEEE
16 years 13 days ago
The Power Balancing Problem in Energy Constrained Multi-Hop Wireless Networks
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
Randeep Bhatia, Abhishek Kashyap, Erran L. Li
IPCCC
2007
IEEE
16 years 13 days ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
SASO
2007
IEEE
16 years 12 days ago
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
Rajesh K. Karmani, Timo Latvala, Gul Agha
174
Voted
SIGECOM
2006
ACM
128views ECommerce» more  SIGECOM 2006»
16 years 2 days ago
Controlling a supply chain agent using value-based decomposition
We present and evaluate the design of Deep Maize, our entry in the 2005 Trading Agent Competition Supply Chain Management scenario. The central idea is to decompose the problem by...
Christopher Kiekintveld, Jason Miller, Patrick R. ...