1727 search results - page 241 / 346 » A Technique for Large Automated Mechanism Design Problems |
168
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
68
Voted
VTS
2000
IEEE
15 years 2 months ago
2000
IEEE
1 At-speed testing is becoming increasingly difficult with external testers as the speed of microprocessors approaches the GHz range. One solution to this problem is built-in self-...
87
Voted
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
81
Voted
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
122
click to vote
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...