5316 search results - page 147 / 1064 » Which Search Problems Are Random |
137
Voted
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
138
Voted
VLSID
2005
IEEE
15 years 9 months ago
2005
IEEE
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
144
Voted
COR
2007
15 years 3 months ago
2007
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
109
Voted
NIPS
2004
15 years 5 months ago
2004
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...
154
Voted
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...