2165 search results - page 84 / 433 » cases 2005 |
103
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
107
Voted
EMISA
2005
Springer
15 years 9 months ago
2005
Springer
: Today, enterprises are forced to continuously optimize their business as well as service processes. In this context the process-centered alignment of information systems is cruci...
117
Voted
EUROCRYPT
2005
Springer
15 years 9 months ago
2005
Springer
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
111
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
118
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This poster presents an evolution strategy for single- and multi-objective optimization. The model uses the predatorprey approach from ecology to scale between both cases. Further...