3415 search results - page 228 / 683 » Lower bounds on kernelization |
170
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract-- Information theory provides a novel perspective on passive sonar performance analysis. This approach begins by partitioning the search space and then considers the probl...
141
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
161
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
164
Voted
WADS
2005
Springer
16 years 3 days ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
215
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...