Sciweavers

435 search results - page 16 / 87
» Deriving Filtering Algorithms from Constraint Checkers
Sort
View
CGF
2008
114views more  CGF 2008»
13 years 8 months ago
Real-time Shading with Filtered Importance Sampling
We propose an analysis of numerical integration based on sampling theory, whereby the integration error caused by aliasing is suppressed by pre-filtering. We derive a pre-filter f...
Jaroslav Krivánek, Mark Colbert
IJCAI
1993
13 years 9 months ago
Domain Filtering can Degrade Intelligent Backtracking Search
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can dete...
Patrick Prosser
CAIP
2007
Springer
156views Image Analysis» more  CAIP 2007»
14 years 13 days ago
Classification of Optical Flow by Constraints
In this paper, we analyse mathematical properties of spatial optical-flow computation algorithm. First by numerical analysis, we derive the convergence property on variational opti...
Yusuke Kameda, Atsushi Imiya
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay