2403 search results - page 333 / 481 » Optimal Randomized RANSAC |
135
Voted
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
During chemical reactions, molecules interact to produce new molecules. Some of the reaction mechanisms are very close to the way gene combine to produce new genes. Like the class...
112
click to vote
STOC
1995
ACM
15 years 7 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
136
Voted
AAAI
2008
15 years 5 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
148
click to vote
AIPS
2007
15 years 5 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
125
Voted
ISQED
2010
IEEE
15 years 5 months ago
2010
IEEE
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...