Sciweavers

4432 search results - page 401 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
CAV
2001
Springer
107views Hardware» more  CAV 2001»
15 years 9 months ago
Job-Shop Scheduling Using Timed Automata
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
Yasmina Abdeddaïm, Oded Maler
IPPS
1999
IEEE
15 years 9 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
GECCO
2006
Springer
212views Optimization» more  GECCO 2006»
15 years 8 months ago
Non-wrapping order crossover: an order preserving crossover operator that respects absolute position
In this paper, we introduce a new crossover operator for the permutation representation of a GA. This new operator-Non-Wrapping Order Crossover (NWOX)--is a variation of the well-...
Vincent A. Cicirello
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
15 years 8 months ago
Automatic Synthesis of Electrical Circuits Containing a Free Variable Using Genetic Programming
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...
John R. Koza, Martin A. Keane, Jessen Yu, William ...
IJCAI
2007
15 years 6 months ago
Symmetric Component Caching
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
Matthew Kitching, Fahiem Bacchus