Sciweavers

829 search results - page 75 / 166
» Bandit Algorithms for Tree Search
Sort
View
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
14 years 11 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
NETWORKING
2004
14 years 11 months ago
Distributed Algorithm for Service Replication in Service Overlay Network
The service overlay network (SON) is an effective mean to deploy end-to-end QoS guaranteed content delivery services on the current Internet. We model the content delivery service ...
Kevin Y. K. Liu, John C. S. Lui, Zhi-Li Zhang
EWSN
2008
Springer
15 years 9 months ago
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...
André Schumacher, Harri Haanpää, ...
WINET
2010
128views more  WINET 2010»
14 years 8 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
IANDC
2008
92views more  IANDC 2008»
14 years 9 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc