Sciweavers

1552 search results - page 289 / 311
» Concepts and Concept-Oriented Programming
Sort
View
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 1 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
80
Voted
IPPS
1998
IEEE
15 years 1 months ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun
89
Voted
EUROCOLT
1995
Springer
15 years 1 months ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
ICCAD
1995
IEEE
144views Hardware» more  ICCAD 1995»
15 years 1 months ago
Background memory management for dynamic data structure intensive processing systems
Abstract -- Telecommunication network management applications often require application-specific ICs that use large dynamically allocated stored data structures. Currently availab...
Gjalt G. de Jong, Bill Lin, Carl Verdonck, Sven Wu...
71
Voted
AOSD
2009
ACM
15 years 28 days ago
A generic and reflective debugging architecture to support runtime visibility and traceability of aspects
In this paper we present a generic, mirror-based debugging architecture that supports runtime visibility and traceability of aspect oriented (AO) software systems. Runtime visibil...
Wouter De Borger, Bert Lagaisse, Wouter Joosen