5316 search results - page 209 / 1064 » Which Search Problems Are Random |
126
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— We propose a novel solution to the problem of inverse kinematics for redundant robotic manipulators for the purposes of goal selection for path planning. We unify the calculati...
135
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
We analyze the problem of detecting a road target in background clutter and investigate the amount of prior (i.e. target specific) knowledge needed to perform this search task. Th...
143
click to vote
WWW
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
125
click to vote
EVOW
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
143
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...