Sciweavers

4722 search results - page 342 / 945
» Encoding Program Executions
Sort
View
CCGRID
2002
IEEE
15 years 11 months ago
A Malleable-Job System for Timeshared Parallel Machines
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
Laxmikant V. Kalé, Sameer Kumar, Jayant DeS...
POPL
1999
ACM
15 years 11 months ago
Constraint Systems for Useless Variable Elimination
Superfluous variables are often produced as the byproducts of program transformations, compilation, and poorly written code. These variables are irrelevant to the computational o...
Mitchell Wand, Igor Siveroni
KR
1998
Springer
15 years 11 months ago
What Robots Can Do
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
Hector J. Levesque
DAGSTUHL
2001
15 years 8 months ago
Visualizing Memory Graphs
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture an...
Thomas Zimmermann, Andreas Zeller
JUCS
2006
100views more  JUCS 2006»
15 years 6 months ago
Expressing Workflow Patterns for Web Services: The Case of PEWS
: PEWS is a language for the implementation of web service interfaces. PEWS programs can be used for the description of both individual and composed web services. Individual web se...
Martin A. Musicante, Edinardo Potrich