1484 search results - page 80 / 297 » Ants meeting algorithms |
GECCO
2009
Springer
13 years 8 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
MLMI
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Prosody has been actively studied as an important knowledge source for speech recognition and understanding. In this paper, we are concerned with the question of exploiti...
MLMI
2007
Springer
14 years 4 months ago
2007
Springer
Automatic segmentation is an important technology for both automatic speech recognition and automatic speech understanding. In meetings, participants typically vocalize for only a ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...