85 search results - page 14 / 17 » Complexity of some Path Problems in DAGs and Linear Orders |
113
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
110
click to vote
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Nowadays, the Quality of Service (QoS) in Optical Grids has become a key issue. An important QoS factor is the resiliency, namely the ability to survive from certain network failur...
104
click to vote
KR
2010
Springer
15 years 4 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
SPATIALCOGNITION
2004
Springer
15 years 5 months ago
2004
Springer
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...