Sciweavers

116 search results - page 7 / 24
» Near optimal online algorithms and fast approximation algori...
Sort
View
CLUSTER
2001
IEEE
13 years 11 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
CPAIOR
2006
Springer
13 years 11 months ago
Online Stochastic Reservation Systems
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
Pascal Van Hentenryck, Russell Bent, Yannis Vergad...
EC
2011
240views ECommerce» more  EC 2011»
13 years 2 months ago
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
Johannes Bader, Eckart Zitzler
GECCO
2009
Springer
169views Optimization» more  GECCO 2009»
14 years 2 days ago
An ant based algorithm for task allocation in large-scale and dynamic multiagent scenarios
This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating i...
Fernando dos Santos, Ana L. C. Bazzan
INFOCOM
2008
IEEE
14 years 1 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...