721 search results - page 114 / 145 » Bounds on the k-domination number of a graph |
131
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
106
click to vote
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
101
click to vote
AI
2008
Springer
14 years 12 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
WINE
2009
Springer
15 years 6 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...