Sciweavers

1361 search results - page 109 / 273
» Boolean Comparison by Simulation
Sort
View
IANDC
2011
129views more  IANDC 2011»
14 years 10 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
QEST
2009
IEEE
15 years 9 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker
ISPASS
2006
IEEE
15 years 9 months ago
Comparing multinomial and k-means clustering for SimPoint
SimPoint is a technique used to pick what parts of the program’s execution to simulate in order to have a complete picture of execution. SimPoint uses data clustering algorithms...
Greg Hamerly, Erez Perelman, Brad Calder
133
Voted
BICOB
2010
Springer
15 years 7 months ago
Folding-aware and Structure-conscious 3D Substructures in Folding Data: Identification and Applications
Molecular dynamics simulations have been employed by biologists to study the protein folding problem. Such simulations have resulted in a large number of protein folding trajector...
Hui Yang, Saurabh Gupte, Runtang Wang, Rahul Parte
MICRO
1995
IEEE
140views Hardware» more  MICRO 1995»
15 years 6 months ago
A system level perspective on branch architecture performance
Accurate instruction fetch and branch prediction is increasingly important on today’s wide-issue architectures. Fetch prediction is the process of determining the next instructi...
Brad Calder, Dirk Grunwald, Joel S. Emer