294 search results - page 24 / 59 » Solving the continuous time multiagent patrol problem |
159
click to vote
AAAI
2012
13 years 6 months ago
2012
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
107
click to vote
CONSTRAINTS
2000
15 years 3 months ago
2000
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
108
Voted
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
164
click to vote
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
142
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...