Sciweavers

1224 search results - page 125 / 245
» Design and Implementation of a Practical Parallel Delaunay A...
Sort
View
ICPP
1998
IEEE
15 years 8 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
TACAS
2005
Springer
155views Algorithms» more  TACAS 2005»
15 years 10 months ago
Context-Bounded Model Checking of Concurrent Software
The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of ve...
Shaz Qadeer, Jakob Rehof
DAC
2005
ACM
16 years 5 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
PPL
2008
185views more  PPL 2008»
15 years 4 months ago
On Design and Application Mapping of a Network-on-Chip(NoC) Architecture
As the number of integrated IP cores in the current System-on-Chips (SoCs) keeps increasing, communication requirements among cores can not be sufficiently satisfied using either ...
Jun Ho Bahn, Seung Eun Lee, Yoon Seok Yang, Jungso...
AC
2008
Springer
15 years 4 months ago
Distributed Sparse Matrices for Very High Level Languages
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...
John R. Gilbert, Steve Reinhardt, Viral Shah