Sciweavers

2663 search results - page 371 / 533
» How to Choose a Timing Model
Sort
View
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
15 years 10 months ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...
AIPS
2000
15 years 7 months ago
Vision-Servoed Localization and Behavior-Based Planning for an Autonomous Quadruped Legged Robot
Planning for real robots to act in dynamic and uncertain environments is a challenging problem. A complete model of the world is not viable and an integration of deliberation and ...
Manuela M. Veloso, Elly Winner, Scott Lenser, Jame...
UAI
2003
15 years 7 months ago
Marginalizing Out Future Passengers in Group Elevator Control
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
Daniel Nikovski, Matthew Brand
ISCA
2007
IEEE
94views Hardware» more  ISCA 2007»
15 years 6 months ago
Tailoring quantum architectures to implementation style: a quantum computer for mobile and persistent qubits
In recent years, quantum computing (QC) research has moved from the realm of theoretical physics and mathematics into real implementations [9]. With many different potential hardw...
Eric Chi, Stephen A. Lyon, Margaret Martonosi
ACMSE
2010
ACM
15 years 4 months ago
Adaptive stable marriage algorithms
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
John Dabney, Brian C. Dean