304 search results - page 7 / 61 » Exploiting problem structure in a genetic algorithm approach... |
ICCCI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. To facilitate communication and the exchange of information between patients, nurses, lab technicians, health insurers, physicians, policy makers, and existing knowledge-...
TSMC
2011
13 years 2 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
COCOON
2005
Springer
13 years 9 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
NC
1998
13 years 9 months ago
1998
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....