Sciweavers

1941 search results - page 310 / 389
» On the Hardness of Approximate Reasoning
Sort
View
PLDI
2003
ACM
15 years 11 months ago
Predicting whole-program locality through reuse distance analysis
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
Chen Ding, Yutao Zhong
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
15 years 11 months ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
15 years 11 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
SMA
2003
ACM
123views Solid Modeling» more  SMA 2003»
15 years 11 months ago
Collision prediction for polyhedra under screw motions
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ByungMoon Kim, Jarek Rossignac
VRST
2003
ACM
15 years 11 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann