Sciweavers

676 search results - page 73 / 136
» Fixed-Parameter Approximation: Conceptual Framework and Appr...
Sort
View
ACST
2006
14 years 11 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara
WSC
2004
14 years 11 months ago
Quasi-Monte Carlo Methods in Finance
We review the basic principles of Quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variancereduction techniques, and the main classes of constructions under...
Pierre L'Ecuyer
PUK
2000
14 years 11 months ago
Dynamic Scheduling of Progressive Processing Plans
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew A...
IJCAI
1989
14 years 11 months ago
Execution Architectures and Compilation
This paper introduces a partition of the possible forms of knowledge according to their rela­ tionship to the basic objective of an intelligent agent, namely to act successfully ...
Stuart J. Russell
CGF
2008
118views more  CGF 2008»
14 years 10 months ago
Manifold-valued Thin-Plate Splines with Applications in Computer Graphics
We present a generalization of thin-plate splines for interpolation and approximation of manifold-valued data, and demonstrate its usefulness in computer graphics with several app...
Florian Steinke, Matthias Hein, Jan Peters, Bernha...