1941 search results - page 32 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
FOCS
1993
IEEE
14 years 3 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
WDAG
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
TASE
2008
IEEE
13 years 10 months ago
2008
IEEE
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
ASPDAC
2009
ACM
14 years 5 months ago
2009
ACM
—In network-on-chip, computing worst-case delay bound for packet delivery is crucial for designing predictable systems but yet an intractable problem due to complicated resource ...
MFCS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...