Sciweavers

3208 search results - page 267 / 642
» A Lower Bound for Primality
Sort
View
ASPDAC
2007
ACM
92views Hardware» more  ASPDAC 2007»
15 years 10 months ago
New Block-Based Statistical Timing Analysis Approaches Without Moment Matching
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
Ruiming Chen, Hai Zhou
CDC
2009
IEEE
15 years 10 months ago
On the queue-overflow probabilities of distributed scheduling algorithms
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
Can Zhao, Xiaojun Lin
VMV
2008
151views Visualization» more  VMV 2008»
15 years 8 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner
AAAI
2006
15 years 8 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons
DAGSTUHL
2004
15 years 8 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter