Sciweavers

1265 search results - page 96 / 253
» Finding the Key to a Synapse
Sort
View
HEURISTICS
2002
108views more  HEURISTICS 2002»
13 years 9 months ago
Cooperative Parallel Tabu Search for Capacitated Network Design
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
Teodor Gabriel Crainic, Michel Gendreau
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 9 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
CN
1998
69views more  CN 1998»
13 years 9 months ago
An Open Framework for Collaborative Distributed Information Management
The MEMOIR project supports researchers working with a vast quantity of distributed information, by assisting them in finding both relevant documents and researchers with related ...
David De Roure, Wendy Hall, Siegfried Reich, Aggel...
INFORMATICALT
2002
72views more  INFORMATICALT 2002»
13 years 9 months ago
Simulation of Conflict in an Agent World: Access to Resources and Possibility of Termination of the Population
The goal of the paper is to create a model for investigating the character of relationships between the freedom and restrictions in the terrorism context, in order to find out how ...
Jaak Tepandi
IPL
2002
74views more  IPL 2002»
13 years 9 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary