Sciweavers

4860 search results - page 538 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
AMAI
2004
Springer
15 years 10 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
ATAL
2004
Springer
15 years 10 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
ATAL
2004
Springer
15 years 10 months ago
Fitting and Compilation of Multiagent Models through Piecewise Linear Functions
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
David V. Pynadath, Stacy Marsella
ECCV
2004
Springer
15 years 10 months ago
Unbiased Errors-In-Variables Estimation Using Generalized Eigensystem Analysis
Recent research provided several new and fast approaches for the class of parameter estimation problems that are common in computer vision. Incorporation of complex noise model (mo...
Matthias Mühlich, Rudolf Mester
ICALP
2004
Springer
15 years 10 months ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson