Sciweavers

3558 search results - page 124 / 712
» Object-Oriented Programming on the Network
Sort
View
IPPS
2003
IEEE
14 years 2 months ago
Applying Aspect-Orient Programming Concepts to a Component-Based Programming Model
Abstract— The execution environments For scientific applications have evolved significantly over the years. Vector and parallel architectures have provided significantly faste...
Thomas Eidson, Jack Dongarra, Victor Eijkhout
MCMASTER
1993
14 years 1 months ago
A Systolizing Compilation Scheme for Nested Loops with Linear Bounds
With the recent advances in massively parallel programmable processor networks, methods for the infusion of massive MIMD parallelism into programs have become increasingly relevant...
Michael Barnett, Christian Lengauer
EUROGP
1999
Springer
137views Optimization» more  EUROGP 1999»
14 years 1 months ago
Evolving Controllers for Autonomous Agents Using Genetically Programmed Networks
– This article presents a new approach to the evolution of controllers for autonomous agents. We propose the evolution of a connectionist structure where each node has an associa...
Arlindo Silva, Ana Neves, Ernesto Costa
AMC
2005
127views more  AMC 2005»
13 years 9 months ago
The identification of nondominated and efficient paths on a network
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...
Gholam Reza Jahanshahloo, F. Hosseinzadeh Lotfi, N...
NETWORKS
2008
13 years 9 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...