Sciweavers

3406 search results - page 429 / 682
» Computational models of classical conditioning
Sort
View
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
15 years 10 months ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
ICCV
2001
IEEE
16 years 8 months ago
3D Object Tracking Using Shape-Encoded Particle Propagation
We present a comprehensive treatment of 3D object tracking by posing it as a nonlinear state estimation problem. The measurements are derived using the outputs of shape-encoded fi...
Hankyu Moon, Rama Chellappa, Azriel Rosenfeld
LICS
2000
IEEE
15 years 11 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
CP
2009
Springer
15 years 10 months ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...
SOFSEM
2010
Springer
16 years 3 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour