Sciweavers

1332 search results - page 102 / 267
» Combinatorial Algorithms
Sort
View
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 11 months ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher
EVOW
2004
Springer
15 years 11 months ago
Scatter Search and Memetic Approaches to the Error Correcting Code Problem
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
Carlos Cotta
IPPS
1999
IEEE
15 years 10 months ago
Mapping Media Streams onto a Network of Servers
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
Reinhard Lüling
ISPD
1997
ACM
74views Hardware» more  ISPD 1997»
15 years 10 months ago
A matrix synthesis approach to thermal placement
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...
Chris C. N. Chu, D. F. Wong
COMPGEOM
1995
ACM
15 years 9 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky