3142 search results - page 302 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
130
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we present a game theoretic approach to solve the static load balancing problem in a distributed system which consists of heterogeneous computers connected by a sing...
142
click to vote
DAGSTUHL
1994
15 years 4 months ago
1994
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
106
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
120
click to vote
TCS
2008
15 years 3 months ago
2008
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
159
click to vote
SIGMOD
2012
ACM
13 years 5 months ago
2012
ACM
In this demo, we will present Tiresias, the first how-to query engine. How-to queries represent fundamental data analysis questions of the form: “How should the input change in...