Sciweavers

1746 search results - page 125 / 350
» Recent Developments in Algorithmic Teaching
Sort
View
TCS
2008
13 years 9 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
TOG
2008
137views more  TOG 2008»
13 years 9 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue...
TPDS
2008
93views more  TPDS 2008»
13 years 9 months ago
Evaluating Dynamic Task Mapping in Network Processor Runtime Systems
Modern network processor systems require the ability to adapt their processing capabilities at runtime to changes in network traffic. Traditionally, network processor applications ...
Xin Huang, Tilman Wolf
NOMS
2010
IEEE
173views Communications» more  NOMS 2010»
13 years 8 months ago
Dynamic resource allocation and power management in virtualized data centers
—We investigate optimal resource allocation and power management in virtualized data centers with time-varying workloads and heterogeneous applications. Prior work in this area u...
Rahul Urgaonkar, Ulas C. Kozat, Ken Igarashi, Mich...
SPIN
2010
Springer
13 years 8 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...