Sciweavers

1110 search results - page 6 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
IAT
2008
IEEE
15 years 4 months ago
Formalizing Multi-state Learning Dynamics
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...
Daniel Hennes, Karl Tuyls, Matthias Rauterberg
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 4 days ago
Improved Randomized Results for That Interval Selection Problem
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...
Leah Epstein, Asaf Levin
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
15 years 2 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
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...
Shihliang Ou, Massoud Pedram
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
15 years 11 days ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
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...
Shashi Mittal, Andreas S. Schulz
ICALP
2009
Springer
15 years 10 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
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...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...