1603 search results - page 90 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
179
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
187
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
128
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...
125
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper, we study the optimal deployment pattern problem in wireless sensor networks (WSNs). We propose a new set of patterns, particularly when sensors’ communication r...
161
click to vote
AAAI
2008
15 years 8 months ago
2008
A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupt...