936 search results - page 34 / 188 » The Synthesis Problem of Netcharts |
IEAAIE
2005
Springer
14 years 1 months ago
2005
Springer
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
14 years 1 months ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
CSJM
2006
13 years 7 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
HYBRID
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The problem of synthesizing feedback controllers that perform sensing and actuation actions on non–uniform and uncertain discrete time domains is considered. This class...