2266 search results - page 29 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
108
click to vote
JCM
2007
14 years 11 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
89
Voted
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
EOR
2007
2007
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
14 years 11 months ago
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
ICES
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Evolutionary methods are now beginning to be used routinely in design applications. However, even with computing speeds growing continuously, for many complex design prob...
107
click to vote
JSAT
2008
14 years 11 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...