2743 search results - page 505 / 549 » Minimization of an M-convex Function |
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
ER
2008
Springer
13 years 11 months ago
2008
Springer
Abstract Although most workflow management systems nowadays offer graphical editors for process modeling, the learning curve is still too steep for users who are unexperienced in p...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
ATMOS
2008
13 years 10 months ago
2008
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...
FPL
2008
Springer
13 years 10 months ago
2008
Springer
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...