Sciweavers

1594 search results - page 92 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 7 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
AAAI
2007
15 years 5 months ago
Learning Graphical Model Structure Using L1-Regularization Paths
Sparsity-promoting L1-regularization has recently been succesfully used to learn the structure of undirected graphical models. In this paper, we apply this technique to learn the ...
Mark W. Schmidt, Alexandru Niculescu-Mizil, Kevin ...
EOR
2006
73views more  EOR 2006»
15 years 3 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
JVCA
2010
94views more  JVCA 2010»
15 years 1 months ago
A hybrid approach for simulating human motion in constrained environments
We present a new algorithm to generate plausible motions for high-DOF human-like articulated figures in constrained environments with multiple obstacles. Our approach is general ...
Jia Pan, Liangjun Zhang, Ming C. Lin, Dinesh Manoc...
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 3 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg