Sciweavers

5214 search results - page 153 / 1043
» The Online Specialization Problem
Sort
View
AUSAI
2003
Springer
15 years 9 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
LICS
2000
IEEE
15 years 8 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 4 months ago
Detecting Coordination Problems in Collaborative Software Development Environments
Software development is rarely an individual effort and generally involves teams of developers collaborating to generate good reliable code. Among the software code there exist te...
Chintan Amrit, Jos van Hillegersberg
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
15 years 4 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
EOR
2007
97views more  EOR 2007»
15 years 4 months ago
Using pattern matching for tiling and packing problems
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fat...