Sciweavers

190 search results - page 35 / 38
» Resources, Concurrency and Local Reasoning
Sort
View
ISLPED
2005
ACM
98views Hardware» more  ISLPED 2005»
14 years 28 days ago
Synonymous address compaction for energy reduction in data TLB
Modern processors can issue and execute multiple instructions per cycle, often performing multiple memory operations simultaneously. To reduce stalls due to resource conflicts, m...
Chinnakrishnan S. Ballapuram, Hsien-Hsin S. Lee, M...
ADHOC
2006
116views more  ADHOC 2006»
13 years 7 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
JFP
2008
72views more  JFP 2008»
13 years 7 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
AAAI
2008
13 years 9 months ago
A Scalable Jointree Algorithm for Diagnosability
Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in...
Anika Schumann, Jinbo Huang
AAAI
2000
13 years 8 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith