Sciweavers

8413 search results - page 163 / 1683
» Ordering Problem Subgoals
Sort
View
GECCO
2004
Springer
14 years 3 months ago
Controlled Content Crossover: A New Crossover Scheme and Its Application to Optical Network Component Allocation Problem
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...
Mohammad Amin Dallaali, Malin Premaratne
FLAIRS
2006
13 years 11 months ago
Tabu Search for a Car Sequencing Problem
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was propos...
Nicolas Zufferey, Martin Studer, Edward A. Silver
COMBINATORICS
2000
128views more  COMBINATORICS 2000»
13 years 10 months ago
Continued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
Mahendra Jani, Robert G. Rieper
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 10 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
TIT
2011
157views more  TIT 2011»
13 years 5 months ago
Decentralized Sequential Hypothesis Testing Using Asynchronous Communication
—An asymptotically optimum test for the problem of decentralized sequential hypothesis testing is presented. The induced communication between sensors and fusion center is asynch...
Georgios Fellouris, George V. Moustakides