740 search results - page 105 / 148 » Tabu search algorithm for chemical process optimization |
188
click to vote
IJCIS
1998
15 years 5 months ago
1998
We present the systematic design and development of a distributed query scheduling service DQS in the context of DIOM, a distributed and interoperable query mediation system 26 ...
171
click to vote
ATAL
2009
Springer
16 years 22 days ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
202
click to vote
GECCO
2009
Springer
16 years 21 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
177
click to vote
EUROCAST
2009
Springer
16 years 21 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
164
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Interactive evolutionary computation (IEC) has proven useful in a variety of applications by combining the subjective evaluation of a user with the massive parallel search power o...