17760 search results - page 295 / 3552 » A Generalization of the Massey-Ding Algorithm |
151
click to vote
ATAL
2003
Springer
15 years 12 months ago
2003
Springer
This paper describes an agent application for the coordination of aircraft repair, refit, refuel, and rearm teams in a dynamic setting. The paper also presents a new algorithm fo...
195
Voted
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we present a detailed analysis of the application of Genetic Programming to the evolution of distributed algorithms. This research field has many facets which make...
169
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
A new sub-optimal subset search method for feature selection is introduced. As opposed to other till now known subset selection methods the oscillating search is not dependent on ...
167
click to vote
CONPAR
1992
15 years 10 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
169
click to vote
DEXA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...