4894 search results - page 431 / 979 » The Guarding Problem - Complexity and Approximation |
198
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
178
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
179
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
217
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
153
click to vote
CCCG
2003
15 years 8 months ago
2003
Abstract Steph Durocher∗ and David Kirkpatrick† Department of Computer Science, University of British Columbia Vancouver BC, Canada Given a set of client positions as input, f...