1802 search results - page 190 / 361 » Complexity Theory for Operators in Analysis |
155
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
145
click to vote
SIGECOM
2009
ACM
16 years 29 days ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
167
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
175
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
162
click to vote
SIGECOM
2005
ACM
16 years 15 hour ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...