828 search results - page 95 / 166 » Bounded Hairpin Completion |
156
click to vote
UAI
1998
15 years 5 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
136
click to vote
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
107
click to vote
AUTOMATICA
2010
15 years 4 months ago
2010
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...
149
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
134
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...