Sciweavers

282 search results - page 44 / 57
» An Algebraic Method for Analyzing Open-Loop Dynamic Systems
Sort
View
88
Voted
TCS
2010
14 years 8 months ago
Itineraries of rigid rotations and diffeomorphisms of the circle
We examine the itinerary of 0 ∈ S1 = R/Z under the rotation by α ∈ R\Q. The motivating question is: if we are given only the itinerary of 0 relative to I ⊂ S1 , a finite un...
David Richeson, Paul Winkler, Jim Wiseman
CGO
2006
IEEE
15 years 1 months ago
Profiling over Adaptive Ranges
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
Shashidhar Mysore, Banit Agrawal, Timothy Sherwood...
LFP
1990
73views more  LFP 1990»
14 years 11 months ago
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
Eric Mohr, David A. Kranz, Robert H. Halstead Jr.
JUCS
2010
215views more  JUCS 2010»
14 years 4 months ago
A Multidisciplinary Survey of Computational Techniques for the Modelling, Simulation and Analysis of Biochemical Networks
: All processes of life are controlled by networks of interacting biochemical components. The purpose of modelling these networks is manifold. From a theoretical point of view it a...
James Decraene, Thomas Hinze
CC
2006
Springer
125views System Software» more  CC 2006»
15 years 1 months ago
Path-Based Reuse Distance Analysis
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...