Sciweavers

1611 search results - page 183 / 323
» A Library for Self-Adjusting Computation
Sort
View
IIE
2007
81views more  IIE 2007»
15 years 6 months ago
Visualize and Open Up
Motivating students of the Nintendo generation for Computer Science can only be achieved by providing them with an exiting and fresh CS1 course. The article describes the experienc...
Michela Pedroni, Till G. Bay
TSI
2008
89views more  TSI 2008»
15 years 6 months ago
RedGRID, un environnement pour la redistribution d'objets complexes
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
Aurélien Esnard
KAIS
2007
121views more  KAIS 2007»
15 years 6 months ago
Node similarity in the citation graph
Published scientific articles are linked together into a graph, the citation graph, through their citations. This paper explores the notion of similarity based on connectivity alo...
Wangzhong Lu, Jeannette C. M. Janssen, Evangelos E...
PE
2002
Springer
111views Optimization» more  PE 2002»
15 years 6 months ago
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agents
This paper evaluates and compares the performance of two approaches for locating an agent in a mobile agent environment. The first approach dynamically creates a chain of forwarde...
Sara Alouf, Fabrice Huet, Philippe Nain
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 5 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...