569 search results - page 12 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
EOR
2002
13 years 8 months ago
2002
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
FLAIRS
2004
13 years 10 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
JALC
2002
13 years 8 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
CEC
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...