5595 search results - page 757 / 1119 » Comparing Subsumption Optimizations |
211
Voted
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
233
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Evolutionary algorithms have successfully been applied to software testing. Not only approaches that search for numeric test data for procedural test objects have been investigate...
192
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
215
click to vote
ICCD
2000
IEEE
15 years 11 months ago
2000
IEEE
A major obstacle to widespread acceptance of formal verification is the difficulty in using the tools effectively. Although learning the basic syntax and operation of a formal ver...
207
click to vote
AIPS
2010
15 years 9 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...