1729 search results - page 202 / 346 » Bound Graph Polysemy |
235
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
321
click to vote
ASUNAM
2011
IEEE
14 years 6 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
156
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
125
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
146
click to vote
CDC
2008
IEEE
16 years 26 days ago
2008
IEEE
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...