Sciweavers

10707 search results - page 317 / 2142
» Designing executable abstractions
Sort
View
AIPS
1996
15 years 6 months ago
Planning Experiments: Resolving Interactions between Two Planning Spaces
Learning from experimentation allows a system to acquire planning domain knowledge by correcting its knowledge when an action execution fails. Experiments are designed and planned...
Yolanda Gil
SCP
2008
150views more  SCP 2008»
15 years 4 months ago
Google's MapReduce programming model - Revisited
Google's MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including it...
Ralf Lämmel
VLSI
2010
Springer
14 years 11 months ago
SESAM extension for fast MPSoC architectural exploration and dynamic streaming applications
Future systems will have to support multiple and concurrent dynamic compute-intensive applications, while respecting real-time and energy consumption constraints. To overcome these...
Nicolas Ventroux, Tanguy Sassolas, Raphael David, ...
HPCA
2011
IEEE
14 years 8 months ago
Calvin: Deterministic or not? Free will to choose
Most shared memory systems maximize performance by unpredictably resolving memory races. Unpredictable memory races can lead to nondeterminism in parallel programs, which can suff...
Derek Hower, Polina Dudnik, Mark D. Hill, David A....
RSP
2003
IEEE
103views Control Systems» more  RSP 2003»
15 years 10 months ago
An Instruction Throughput Model of Superscalar Processors
With advances in semiconductor technology, processors are becoming larger and more complex. Future processor designers will face an enormous design space, and must evaluate more a...
Tarek M. Taha, D. Scott Wills