5316 search results - page 52 / 1064 » Which Search Problems Are Random |
108
Voted
MP
2006
15 years 22 days ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
121
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Time...
90
Voted
ROBOCOMM
2007
IEEE
15 years 7 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
102
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Finding fiducial facial points in any frame of a video showing rich naturalistic facial behaviour is an unsolved problem. Yet this is a crucial step for geometric-featurebased fa...
93
Voted
AAAI
1997
15 years 2 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...