246 search results - page 21 / 50 » Dynamic Local Search for the Maximum Clique Problem |
157
click to vote
SLS
2009
Springer
15 years 2 months ago
2009
Springer
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
ISBI
2008
IEEE
15 years 10 months ago
2008
IEEE
We address the problem of fast and accurate localization of miniature surgical instruments like needles or electrodes using 3D ultrasound (US). An algorithm based on maximizing a ...
AAAI
1998
14 years 11 months ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
TSMC
1998
14 years 9 months ago
1998
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
150
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
The ambiguity inherent in a localized analysis of events from video can be resolved by exploiting constraints between events and examining only feasible global explanations. We sho...