Sciweavers

1040 search results - page 94 / 208
» Rounding algorithms for covering problems
Sort
View
GECCO
2010
Springer
176views Optimization» more  GECCO 2010»
14 years 12 months ago
A hierarchical cooperative evolutionary algorithm
To successfully search multiple coadaptive subcomponents in a solution, we developed a novel cooperative evolutionary algorithm based on a new computational multilevel selection f...
Shelly Xiaonan Wu, Wolfgang Banzhaf
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
15 years 10 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
FSTTCS
2010
Springer
14 years 7 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
MMB
1999
Springer
127views Communications» more  MMB 1999»
15 years 2 months ago
Auction Models for Multi-Provider Internet Connections
Auctions are a widely used approach for determining the current market price for congested resources. However, using them for real systems, such as the Internet, the auction algor...
Peter Reichl, George Fankhauser, Burkhard Stiller
CSCLP
2007
Springer
15 years 4 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...