2899 search results - page 398 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
140
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
162
Voted
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
183
Voted
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
172
click to vote
MOBICOM
2004
ACM
15 years 11 months ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
143
Voted
DAGM
2003
Springer
15 years 10 months ago
2003
Springer
In this paper, we present a real-time PCB inspection system which can detect defects including the breaks in the wires and short circuit. The proposed inspection algorithm is based...