5316 search results - page 338 / 1064 » Which Search Problems Are Random |
223
click to vote
CODES
2001
IEEE
15 years 11 months ago
2001
IEEE
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
192
click to vote
FGR
2004
IEEE
15 years 11 months ago
2004
IEEE
In the recent years particle filtering has been the dominant paradigm for tracking facial and body features, recognizing temporal events and reasoning in uncertainty. A major prob...
188
click to vote
IDA
2008
Springer
15 years 7 months ago
2008
Springer
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
202
click to vote
JCST
2010
15 years 2 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
190
click to vote
IJCAI
2003
15 years 8 months ago
2003
The availability of web search has revolutionised the way people discover information, yet as search services maintain larger and larger indexes they are in danger of becoming a v...