Sciweavers

387 search results - page 49 / 78
» Many Random Walks Are Faster Than One
Sort
View
DAC
2010
ACM
14 years 29 days ago
An efficient algorithm to verify generalized false paths
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
Olivier Coudert
GLVLSI
2009
IEEE
113views VLSI» more  GLVLSI 2009»
14 years 27 days ago
Reducing parity generation latency through input value aware circuits
1 Soft errors caused by cosmic particles and radiation emitted by the packaging are an important problem in contemporary microprocessors. Parity bits are used to detect single bit ...
Yusuf Osmanlioglu, Y. Onur Koçberber, Oguz ...
EDBT
2000
ACM
14 years 20 days ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
AGI
2008
13 years 10 months ago
Transfer Learning and Intelligence: an Argument and Approach
In order to claim fully general intelligence in an autonomous agent, the ability to learn is one of the most central capabilities. Classical machine learning techniques have had ma...
Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
AAAI
2010
13 years 10 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos