Sciweavers

230 search results - page 14 / 46
» Quantum Search with Variable Times
Sort
View
78
Voted
IEEEICCI
2005
IEEE
15 years 6 months ago
How to disregard irrelevant stimulus dimensions: evidence from comparative visual search
To what extent is it possible to disregard stimulus dimensions that are irrelevant to a certain task? This question was tackled in three experiments using the paradigm of comparat...
Marc Pomplun, E. Carbone, Lorenz Sichelschmidt, B....
101
Voted
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
15 years 6 months ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Rüdiger Ebendt, Rolf Drechsler
ISCAS
2005
IEEE
182views Hardware» more  ISCAS 2005»
15 years 6 months ago
Efficient search and mode prediction algorithms for motion estimation in H.264/AVC
—H.264 video coding standard adopts different coding schemes like variable block sizes and multiple reference frames for motion estimation. Hence, H.264/AVC provides gains in com...
Gwo-Long Li, Mei-Juan Chen, Hung-Ju Li, Ching-Ting...
98
Voted
HYBRID
1994
Springer
15 years 4 months ago
Symbolic Controller Synthesis for Discrete and Timed Systems
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
Eugene Asarin, Oded Maler, Amir Pnueli
AUSAI
2003
Springer
15 years 5 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar