Sciweavers

1279 search results - page 189 / 256
» Fast Implementations of Automata Computations
Sort
View
PE
2008
Springer
109views Optimization» more  PE 2008»
13 years 9 months ago
A conditional probability approach to M/G/1-like queues
Following up on a recently renewed interest in computational methods for M/G/1-type processes, this paper considers an M/G/1-like system in which the service time distribution is ...
Alexandre Brandwajn, Hongyun Wang
CGF
1998
101views more  CGF 1998»
13 years 9 months ago
Rapid and Accurate Contact Determination between Spline Models using ShellTrees
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...
HOTNETS
2010
13 years 4 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio
DAC
2011
ACM
12 years 9 months ago
AENEID: a generic lithography-friendly detailed router based on post-RET data learning and hotspot detection
In the era of deep sub-wavelength lithography for nanometer VLSI designs, manufacturability and yield issues are critical and need to be addressed during the key physical design i...
Duo Ding, Jhih-Rong Gao, Kun Yuan, David Z. Pan
VLSISP
2011
358views Database» more  VLSISP 2011»
13 years 4 months ago
Accelerating Machine-Learning Algorithms on FPGAs using Pattern-Based Decomposition
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
Karthik Nagarajan, Brian Holland, Alan D. George, ...