1603 search results - page 42 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
ASIAN
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
CVPR
2004
IEEE
16 years 9 hour ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
AICCSA
2006
IEEE
15 years 4 months ago
2006
IEEE
The problem of optimally deploying a heterogeneous set of sensing devices in environments with differential surveillance requirements is presented. The problem is formulated in th...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
DAGSTUHL
2006
14 years 11 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...