Sciweavers

364 search results - page 14 / 73
» A benchmark for the sorting network problem
Sort
View
EMO
2005
Springer
194views Optimization» more  EMO 2005»
14 years 7 days ago
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
Michael Emmerich, Nicola Beume, Boris Naujoks
JSAT
2006
108views more  JSAT 2006»
13 years 6 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
CEC
2009
IEEE
13 years 11 months ago
Memory-enhanced Evolutionary Robotics: The Echo State Network Approach
— Interested in Evolutionary Robotics, this paper focuses on the acquisition and exploitation of memory skills. The targeted task is a well-studied benchmark problem, the Tolman ...
Cédric Hartland, Nicolas Bredeche, Mich&egr...
PC
1998
202views Management» more  PC 1998»
13 years 6 months ago
BSPlib: The BSP programming library
BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full de nition of BSPl...
Jonathan M. D. Hill, Bill McColl, Dan C. Stefanesc...
AAAI
2011
12 years 6 months ago
Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs
Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) for binary CSPs. In this paper, we introduce RNIC, the extension of NIC to nonbinary CSPs, and describe a...
Robert J. Woodward, Shant Karakashian, Berthe Y. C...