Sciweavers

4469 search results - page 254 / 894
» Dynamic Program Slicing
Sort
View
IOR
2010
98views more  IOR 2010»
15 years 4 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
PPOPP
2011
ACM
14 years 9 months ago
Programming the memory hierarchy revisited: supporting irregular parallelism in sequoia
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
Michael Bauer, John Clark, Eric Schkufza, Alex Aik...
156
Voted
IAT
2006
IEEE
16 years 27 days ago
Towards High-Level Programming for Distributed Problem Solving
We present a new approach to distributed problem solving based on high-level program execution. While this technique has proven itself for single-agent systems based on the Golog ...
Ryan F. Kelly, Adrian R. Pearce
192
Voted
SPIN
2005
Springer
16 years 10 days ago
Symbolic Model Checking for Asynchronous Boolean Programs
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
Byron Cook, Daniel Kroening, Natasha Sharygina
EUROGP
1999
Springer
151views Optimization» more  EUROGP 1999»
15 years 11 months ago
Phenotype Plasticity in Genetic Programming: A Comparison of Darwinian and Lamarckian Inheritance Schemes
Abstract We consider a form of phenotype plasticity in Genetic Programming (GP). This takes the form of a set of real-valued numerical parameters associated with each individual, a...
Anna Esparcia-Alcázar, Ken Sharman