Sciweavers

1322 search results - page 61 / 265
» Parameterized counting problems
Sort
View
SIGMETRICS
2008
ACM
101views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
How to parameterize models with bursty workloads
Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...
Giuliano Casale, Ningfang Mi, Ludmila Cherkasova, ...
SIGCOMM
2009
ACM
14 years 3 months ago
Every microsecond counts: tracking fine-grain latencies with a lossy difference aggregator
Many network applications have stringent end-to-end latency requirements, including VoIP and interactive video conferencing, automated trading, and high-performance computing—wh...
Ramana Rao Kompella, Kirill Levchenko, Alex C. Sno...
ICCAD
2006
IEEE
177views Hardware» more  ICCAD 2006»
14 years 5 months ago
Application-specific customization of parameterized FPGA soft-core processors
Soft-core microprocessors mapped onto field-programmable gate arrays (FPGAs) represent an increasingly common embedded software implementation option. Modern FPGA soft-cores are p...
David Sheldon, Rakesh Kumar, Roman L. Lysecky, Fra...
CGF
2006
202views more  CGF 2006»
13 years 8 months ago
GPU-based Collision Detection for Deformable Parameterized Surfaces
Based on the potential of current programmable GPUs, recently several approaches were developed that use the GPU to calculate deformations of surfaces like the folding of cloth or...
Alexander Greß, Michael Guthe, Reinhard Klei...
AAAI
2006
13 years 10 months ago
Performing Incremental Bayesian Inference by Dynamic Model Counting
The ability to update the structure of a Bayesian network when new data becomes available is crucial for building adaptive systems. Recent work by Sang, Beame, and Kautz (AAAI 200...
Wei Li 0002, Peter van Beek, Pascal Poupart