Sciweavers

526 search results - page 79 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
EUMAS
2006
15 years 5 months ago
Near-Optimal Anytime Coalition Structure Generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
JMLR
2002
140views more  JMLR 2002»
15 years 3 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
QSHINE
2009
IEEE
15 years 10 months ago
Joint Optimization of System Lifetime and Network Performance for Real-Time Wireless Sensor Networks
Maximizing the aggregate network utility and minimizing the network energy consumption are important but conflict goals in wireless sensor networks. Challenges arise due to the app...
Lei Rao, Xue Liu, Jian-Jia Chen, Wenyu Liu
BROADNETS
2007
IEEE
15 years 10 months ago
On energy aware routing in wireless networks
—Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flo...
Aravind B. Mohanoor, Sridhar Radhakrishnan, Venkat...
TKDE
2008
112views more  TKDE 2008»
15 years 4 months ago
IDD: A Supervised Interval Distance-Based Method for Discretization
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...
Francisco J. Ruiz, Cecilio Angulo, Núria Ag...