Sciweavers

620 search results - page 83 / 124
» Likelihood Computations Using Value Abstraction
Sort
View
ASIAN
2004
Springer
150views Algorithms» more  ASIAN 2004»
14 years 3 months ago
Concurrent Constraint-Based Memory Machines: A Framework for Java Memory Models
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
Vijay A. Saraswat
MSV
2007
13 years 11 months ago
FMC-QE: A New Approach in Quantitative Modeling
Abstract—Service requests are the origin of every service provisioning process and therefore the entities to be considered first. Similar to Physics and Engineering Sciences, ser...
Werner Zorn
ESOP
1999
Springer
14 years 2 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
COMPUTER
2002
129views more  COMPUTER 2002»
13 years 9 months ago
Networks on Chips: A New SoC Paradigm
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
Luca Benini, Giovanni De Micheli
CONCUR
1998
Springer
14 years 2 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert