106 search results - page 5 / 22 » Characterizing Minimal Interval Completions |
APPML
2008
13 years 7 months ago
2008
We provide a complete answer to the problem which consists in finding an unpointed convex cone lying at minimal bounded Pompeiu-Hausdorff distance from a pointed one. We give also...
TIME
2009
IEEE
14 years 2 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
ENDM
2008
13 years 7 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
NOMS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—The advance on data transmission in optical networks has allowed data forwarding decisions to be taken at multiple levels in the protocol stack (e.g., at network and opt...