Sciweavers

1945 search results - page 203 / 389
» Speeding up Serpent
Sort
View
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
16 years 16 days ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
ACG
2006
Springer
16 years 15 days ago
Move-Pruning Techniques for Monte-Carlo Go
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
Bruno Bouzy
CHARME
2005
Springer
136views Hardware» more  CHARME 2005»
16 years 1 days ago
Acceleration of SAT-Based Iterative Property Checking
Today, verification is becoming the dominating factor for successful circuit designs. In this context formal verification techniques allow to prove the correctness of a circuit ...
Daniel Große, Rolf Drechsler
FROCOS
2005
Springer
16 years 23 hour ago
Combination of Isabelle/HOL with Automatic Tools
We describe results and status of a sub project of the Verisoft [1] project. While the Verisoft project aims at verification of a complete computer system starting with hardware a...
Sergey Tverdyshev
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
15 years 12 months ago
Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
Weiping Shi, Zhuo Li, Charles J. Alpert