Sciweavers

1844 search results - page 110 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
RTAS
2005
IEEE
15 years 10 months ago
Optimal Time-Variant Resource Allocation for Internet Servers with Delay
The increasing popularity of high-volume performancecritical Internet applications calls for a scalable server design that allows meeting individual response-time guarantees. Cons...
Xiliang Zhong, Cheng-Zhong Xu, Minghua Xu, Jianbin...
JMLR
2010
125views more  JMLR 2010»
14 years 11 months ago
Regret Bounds for Gaussian Process Bandit Problems
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
Steffen Grünewälder, Jean-Yves Audibert,...
133
Voted
CISS
2008
IEEE
15 years 11 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 5 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
EUROMICRO
1999
IEEE
15 years 9 months ago
Design Space Exploration in System Level Synthesis under Memory Constraints
This paper addresses the problem of component selection, task assignment and task scheduling for distributed embedded computer systems. Such systems have a large number of constra...
Radoslaw Szymanek, Krzysztof Kuchcinski