3600 search results - page 215 / 720 » Conversational intelligence analysis |
131
Voted
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
113
Voted
MICAI
2004
Springer
15 years 9 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
110
Voted
AE
1997
Springer
15 years 7 months ago
1997
Springer
In the running of a genetic algorithm, the population is liable to be con ned in the local optimum, that is the metastable state, making an equilibrium. It is known that, after a l...
143
Voted
AGP
1993
IEEE
15 years 7 months ago
1993
IEEE
Abstract. This paper presents a general approach to the Abstract Interpretation of Prolog programs with cut. In most of previous approaches the cut primitive is merely ignored. Our...
126
click to vote
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper we derive a simpler form of Particle Swarm Optimiser (PSO) which still retains the key properties of the original model. We do so by progressively altering the origin...