Sciweavers

1702 search results - page 55 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
ICCAD
2007
IEEE
91views Hardware» more  ICCAD 2007»
14 years 4 months ago
Variation-aware task allocation and scheduling for MPSoC
— As technology scales, the delay uncertainty caused by process variations has become increasingly pronounced in deep submicron designs. As a result, a paradigm shift from determ...
Feng Wang 0004, Chrysostomos Nicopoulos, Xiaoxia W...
APSEC
1995
IEEE
13 years 11 months ago
An Efficient Debugging Method for Message-based Parallel Programs using Static Analysis Information
Guaranteeiq reproducibility and minimizing probe effects are major issues in the parallel program debugging. This paper suggests a new debugging method, named Detect and Reproduce...
Hyun Seop Bae, Yong Rae Kwon, Hyeon Soo Kim
JCB
2006
115views more  JCB 2006»
13 years 7 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
ICTAI
2006
IEEE
14 years 1 months ago
Efficient Search Using Bitboard Models
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
Pablo San Segundo, Ramón Galán, Fern...
PODC
2009
ACM
14 years 8 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher