Sciweavers

2314 search results - page 332 / 463
» Monoids over domains
Sort
View
140
Voted
AIPS
2006
15 years 3 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
117
Voted
DMIN
2006
134views Data Mining» more  DMIN 2006»
15 years 3 months ago
Hyper-Rectangular and k-Nearest-Neighbor Models in Stochastic Discrimination
The stochastic discrimination (SD) theory considers learning as building models of uniform coverage over data distributions. Despite successful trials of the derived SD method in s...
Iryna Skrypnyk, Tin Kam Ho
125
Voted
FLAIRS
2004
15 years 3 months ago
Towards Acquiring Case Indexing Taxonomies From Text
Taxonomic case-based reasoning is a conversational casebased reasoning methodology that employs feature subsumption taxonomies for incremental case retrieval. Although this approa...
Kalyan Moy Gupta, David W. Aha
FLAIRS
2004
15 years 3 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
ICAD
2004
15 years 3 months ago
A Generic, Semantically-Based Design Approach for Spatial Auditory Computer Displays
This paper describes a design approach for creating generic computer user interfaces with spatial auditory displays. It proposes a structured depiction process from formulating mo...
Christopher Frauenberger, Robert Höldrich, Al...