Sciweavers

281 search results - page 15 / 57
» heuristics 2000
Sort
View
RTA
2000
Springer
14 years 1 months ago
Linear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
Philippe de Groote
IPPS
2000
IEEE
14 years 2 months ago
A Parallel Co-evolutionary Metaheuristic
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
Vincent Bachelet, El-Ghazali Talbi
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 2 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
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
14 years 2 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
Esa Hyytiä, Jorma T. Virtamo
CI
2000
134views more  CI 2000»
13 years 9 months ago
Choosing Rhetorical Structures to Plan Instructional Texts
This paper discusses a fundamental problem in natural language generation: how to organize the content of a text in a coherent and natural way. In this research, we set out to det...
Leila Kosseim, Guy Lapalme