92 search results - page 3 / 19 » Making the Breakout Algorithm Complete Using Systematic Sear... |
ENTCS
2007
13 years 5 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— For the past decade or so, evolutionary multiobjective optimization (EMO) methodologies have earned wide popularity for solving complex practical optimization problems,...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
JCIT
2008
13 years 5 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
TAINN
2005
Springer
13 years 10 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...