1566 search results - page 86 / 314 » On a Cone Covering Problem |
158
click to vote
HEURISTICS
2010
15 years 1 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
142
click to vote
SAT
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
175
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
158
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
161
click to vote
ACSD
2009
IEEE
15 years 11 months ago
2009
IEEE
The application of synthesis of Petri nets from languages for practical problems has recently attracted increasing attention. However, the classical synthesis problems are often n...