Sciweavers

1184 search results - page 228 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
FSS
2010
147views more  FSS 2010»
14 years 8 months ago
A divide and conquer method for learning large Fuzzy Cognitive Maps
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems. FCMs were applied in a large number of diverse areas and have already gained momentu...
Wojciech Stach, Lukasz A. Kurgan, Witold Pedrycz
CP
2004
Springer
15 years 1 months ago
ID Walk: A Candidate List Strategy with a Simple Diversification Device
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
Bertrand Neveu, Gilles Trombettoni, Fred Glover
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 1 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
15 years 1 months ago
Emergent mating topologies in spatially structured genetic algorithms
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
Joshua L. Payne, Margaret J. Eppstein
VLDB
2007
ACM
145views Database» more  VLDB 2007»
15 years 9 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar