1110 search results - page 6 / 222 » New Approximation Results for Resource Replication Problems |
138
click to vote
IAT
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper extends the link between evolutionary game theory and multi-agent reinforcement learning to multistate games. In previous work, we introduced piecewise replicator dynam...
161
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
119
click to vote
ASPDAC
1999
ACM
15 years 8 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
140
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
174
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...