4894 search results - page 481 / 979 » The Guarding Problem - Complexity and Approximation |
146
click to vote
AAAI
2006
15 years 6 months ago
2006
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
141
click to vote
IAAI
2001
15 years 6 months ago
2001
: CARMA is an advisory system for rangeland grasshopper infestations that demonstrates how AI technology can deliver expert advice to compensate for cutbacks in public services. CA...
146
click to vote
NIPS
2001
15 years 6 months ago
2001
Over the last years, particle filters have been applied with great success to a variety of state estimation problems. We present a statistical approach to increasing the efficienc...
128
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
139
click to vote
JCO
2006
15 years 5 months ago
2006
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...