13987 search results - page 440 / 2798 » The Two Guards Problem |
158
click to vote
CONCUR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
180
click to vote
SSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
196
click to vote
DEXAW
2008
IEEE
16 years 1 months ago
2008
IEEE
Two new variants of Particle Swarm Optimization (PSO) called AMPSO1 and AMPSO2 are proposed for global optimization problems. Both the algorithms use adaptive mutation using Beta ...
184
click to vote
TASE
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
190
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...