Sciweavers

670 search results - page 38 / 134
» Brain-Like Approximate Reasoning
Sort
View
KR
2004
Springer
14 years 3 months ago
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Rong Zhou, Eric A. Hansen
DLOG
2004
13 years 11 months ago
Sonic: System Description
Sonic1 is the first prototype implementation of non-standard inferences for Description Logics that can be used via a graphical user interface. In addition to that our implementat...
Anni-Yasmin Turhan, Christian Kissig
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 3 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
GEOINFO
2004
13 years 11 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...