3663 search results - page 341 / 733 » Problems in the ontology of computer programs |
166
click to vote
MP
2008
15 years 6 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
195
Voted
TRANSCI
2008
15 years 6 months ago
2008
Abstract. We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation th...
167
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
160
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
171
click to vote
PG
1998
IEEE
15 years 11 months ago
1998
IEEE
The construction of shape spaces is studied from a mathematical and a computational viewpoint. A program is outlined reducing the problem to four tasks: the representation of geom...