Sciweavers

3481 search results - page 662 / 697
» Exploration in Relational Worlds
Sort
View
LCPC
2001
Springer
14 years 1 months ago
A Comparative Evaluation of Parallel Garbage Collector Implementations
While uniprocessor garbage collection is relatively well understood, experience with collectors for large multiprocessor servers is limited and it is unknown which techniques best ...
C. Richard Attanasio, David F. Bacon, Anthony Cocc...
NEUROSCIENCE
2001
Springer
14 years 1 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
WCRE
2000
IEEE
14 years 1 months ago
A Structured Demonstration of Five Program Comprehension Tools: Lessons Learnt
The purpose of this panel is to report on a structured demonstration for comparing program comprehension tools. Five program comprehension tool designers applied their tools to a ...
Susan Elliott Sim, Margaret-Anne D. Storey, Andrea...
ATAL
2000
Springer
14 years 1 months ago
Task Coordination Paradigms for Information Agents
In agent systems, different (autonomous) agents collaborate to execute complex tasks. Each agent provides a set of useful capabilities, and the agent system combines these capabili...
Marian H. Nodine, Damith Chandrasekara, Amy Unruh
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 1 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla