1215 search results - page 128 / 243 » Application domain study of evolutionary algorithms in optim... |
129
click to vote
CP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
130
click to vote
CODES
2011
IEEE
14 years 1 months ago
2011
IEEE
Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are ...
119
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
110
click to vote
AAAI
2008
15 years 3 months ago
2008
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
102
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...