Sciweavers

420 search results - page 77 / 84
» A case for run-time adaptation in packet processing systems
Sort
View
COGSR
2010
102views more  COGSR 2010»
13 years 2 months ago
Emergence of self-organized symbol-based communication in artificial creatures
In this paper, we describe a digital scenario where we simulated the emergence of self-organized symbol-based communication among artificial creatures inhabiting a virtual world of...
Angelo Loula, Ricardo R. Gudwin, Charbel Niñ...
ICTAI
1992
IEEE
13 years 11 months ago
Automated Parameter Tuning in Stereo Vision Under Time Constraints
This paper presents a method for tuning parameters under a fixed time constraint for a general binocular stereo-vision algorithm. A major difficulty in stereo vision, as well as i...
Steven R. Schwartz, Benjamin W. Wah
QEST
2010
IEEE
13 years 5 months ago
Automatic Compositional Reasoning for Probabilistic Model Checking of Hardware Designs
Adaptive techniques like voltage and frequency scaling, process variations and the randomness of input data contribute signi cantly to the statistical aspect of contemporary hardwa...
Jayanand Asok Kumar, Shobha Vasudevan
PADS
1999
ACM
13 years 11 months ago
Shock Resistant Time Warp
In an attempt to cope with time-varying workload, traditional adaptive Time Warp protocols are designed to react in response to performance changes by altering control parameter c...
Alois Ferscha, James Johnson
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 7 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah