Sciweavers

2880 search results - page 254 / 576
» Approximate Range Searching
Sort
View
WAOA
2004
Springer
85views Algorithms» more  WAOA 2004»
15 years 9 months ago
A PTAS for Delay Minimization in Establishing Wireless Conference Calls
A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system has to establish a call between users, it may nee...
Leah Epstein, Asaf Levin
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
15 years 7 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
AIPS
2006
15 years 5 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
AI
2008
Springer
15 years 4 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
15 years 2 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos