Sciweavers

1615 search results - page 160 / 323
» Adaptive programming in JAsCo
Sort
View
GECCO
2008
Springer
250views Optimization» more  GECCO 2008»
15 years 4 months ago
Community detection in social networks with genetic algorithms
A new genetic algorithm to detect communities in social networks is presented. The algorithm uses a fitness function able to identify groups of nodes in the network having dense ...
Clara Pizzuti
148
Voted
ANOR
2008
171views more  ANOR 2008»
15 years 3 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
96
Voted
COR
2008
96views more  COR 2008»
15 years 3 months ago
Discrete models for competitive location with foresight
We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective ...
Frank Plastria, Lieselot Vanhaverbeke
DAM
2008
88views more  DAM 2008»
15 years 3 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
132
Voted
IEE
2008
108views more  IEE 2008»
15 years 3 months ago
Mining execution relations for crosscutting concerns
Aspect mining tries to identify crosscutting concerns in the code of existing systems and thus supports their adaption to an aspect-oriented design. A semi-automatic static aspect...
Jens Krinke