Sciweavers

1380 search results - page 143 / 276
» A General Polynomial Sieve
Sort
View
CPAIOR
2004
Springer
14 years 2 months ago
Cost Evaluation of Soft Global Constraints
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
Nicolas Beldiceanu, Thierry Petit
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 2 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
14 years 2 months ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste
ICALP
2004
Springer
14 years 2 months ago
A Note on Karr's Algorithm
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Markus Müller-Olm, Helmut Seidl
LCTRTS
2004
Springer
14 years 2 months ago
Flattening statecharts without explosions
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
Andrzej Wasowski