3055 search results - page 196 / 611 » Randomized Search Trees |
114
click to vote
KI
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
97
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
115
Voted
JIRS
2010
14 years 11 months ago
2010
Abstract This paper presents a methodology based on a variation of the Rapidlyexploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial veh...
105
Voted
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
79
Voted
ECCV
2004
Springer
16 years 2 months ago
2004
Springer
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...