Sciweavers

2968 search results - page 178 / 594
» Network Programming Using PLAN
Sort
View
SBACPAD
2005
IEEE
177views Hardware» more  SBACPAD 2005»
15 years 8 months ago
Automatic Data-Flow Graph Generation of MPI Programs
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
Rafael Ennes Silva, Guilherme P. Pezzi, Nicolas Ma...
NETWORKS
2008
15 years 3 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
FAC
2010
106views more  FAC 2010»
15 years 11 days ago
Automatic verification of Java programs with dynamic frames
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
Jan Smans, Bart Jacobs, Frank Piessens, Wolfram Sc...
WCRE
1997
IEEE
15 years 6 months ago
Reverse Engineering is Reverse Forward Engineering
Reverse Engineering is focused on the challenging task of understanding legacy program code without having suitable documentation. Using a transformational forward engineering per...
Ira D. Baxter, Michael Mehlich
CLIMA
2010
15 years 4 months ago
An Agent Language with Destructive Assignment and Model-Theoretic Semantics
In this paper we present an agent language that combines agent functionality with an action theory and model-theoretic semantics. The language is based on abductive logic programmi...
Robert A. Kowalski, Fariba Sadri