1054 search results - page 40 / 211 » Capacitated Domination Problem |
100
Voted
AAAI
2012
13 years 4 months ago
2012
In AI research, mechanism design is typically used to allocate tasks and resources to agents holding private information about their values for possible allocations. In this conte...
122
click to vote
ISLPED
1995
ACM
15 years 6 months ago
1995
ACM
Thispaper proposes a method for achieving low-power control-logic modules using a combination of CMOS complex gate reorganization, transistor size optimization, and transistor lay...
217
click to vote
ICDCN
2011
Springer
14 years 6 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
103
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
107
click to vote
POPL
1994
ACM
15 years 6 months ago
1994
ACM
We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and dele...