Sciweavers

13987 search results - page 155 / 2798
» The Two Guards Problem
Sort
View
150
Voted
AUSAI
2003
Springer
15 years 8 months ago
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
Ying Kong, Fan Wang, Andrew Lim, Songshan Guo
132
Voted
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 7 months ago
Domain Knowledge and Representation in Genetic Algorithms for Real World Scheduling Problems
This paper discusses the issues that arise in the design and implementation of an industrialstrength evolutionary-based system for the optimization of the monthly work schedules f...
Ioannis T. Christou, Armand Zakarian
114
Voted
RANLP
2003
15 years 4 months ago
Combining independent modules in lexical multiple-choice problems
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...
Peter D. Turney, Michael L. Littman, Jeffrey Bigha...
113
Voted
AES
2007
Springer
92views Cryptology» more  AES 2007»
15 years 3 months ago
MicroARTMAP for pattern recognition problems
Pattern recognition is an important aspect of a dominant technology such as machine intelligence. Domain specific fuzzy-neuro models particularly for the ‘black box’ implemen...
Sundaramoorthy Rajasekaran, Vasantha Kalyani David
153
Voted
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 3 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo