Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
9 years 2 months ago
DESKS: Direction-Aware Spatial Keyword Search
— Location-based services (LBS) have been widely accepted by mobile users. Many LBS users have direction-aware search requirement that answers must be in a search direction. Howe...
Guoliang Li, Jianhua Feng, Jing Xu
CCP
2011
92views more  CCP 2011»
9 years 11 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
10 years 9 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
ISCI
2008
117views more  ISCI 2008»
10 years 11 months ago
Search based software testing of object-oriented containers
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
Andrea Arcuri, Xin Yao
DAMON
2009
Springer
11 years 21 days ago
k-ary search on modern processors
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner
CEC
2010
IEEE
11 years 21 days ago
Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
James A. R. Marshall, Thomas G. Hinton
UAI
1996
11 years 28 days ago
Learning Equivalence Classes of Bayesian Network Structures
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...
David Maxwell Chickering
SFP
2000
11 years 28 days ago
Parallel heuristic search in Haskell
Abstract: Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms...
Michelle Cope, Ian P. Gent, Kevin Hammond
UAI
2003
11 years 29 days ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
IJCAI
2003
11 years 29 days ago
Multiple Agents Moving Target Search
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). The...
Mark Goldenberg, Alexander Kovarsky, Xiaomeng Wu, ...
books