Sciweavers

3359 search results - page 555 / 672
» A Simplified Idea Algorithm
Sort
View
NIPS
2003
13 years 11 months ago
Non-linear CCA and PCA by Alignment of Local Models
We propose a non-linear Canonical Correlation Analysis (CCA) method which works by coordinating or aligning mixtures of linear models. In the same way that CCA extends the idea of...
Jakob J. Verbeek, Sam T. Roweis, Nikos A. Vlassis
AAAI
2000
13 years 11 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
AAAI
1998
13 years 11 months ago
Qualitative Simulation as a Temporally-extended Constraint Satisfaction Problem
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
Daniel J. Clancy, Benjamin Kuipers
AIPS
2000
13 years 11 months ago
Planning with Incomplete Information as Heuristic Search in Belief Space
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
Blai Bonet, Hector Geffner
AIPS
2000
13 years 11 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner