Sciweavers

1461 search results - page 35 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
ICPR
2010
IEEE
15 years 15 min ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina
AAAI
2004
15 years 1 months ago
Stochastic Local Search for POMDP Controllers
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
Darius Braziunas, Craig Boutilier
COMCOM
2010
246views more  COMCOM 2010»
14 years 10 months ago
Tabu search algorithm for RP selection in PIM-SM multicast routing
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
Hua Wang, Xiangxu Meng, Min Zhang, Yanlong Li
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
15 years 5 months ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Rüdiger Ebendt, Rolf Drechsler
EPIA
2001
Springer
15 years 4 months ago
Global Hull Consistency with Local Search for Continuous Constraint Solving
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution s...
Jorge Cruz, Pedro Barahona