2116 search results - page 158 / 424 » On Probabilistic Alternating Simulations |
132
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...
119
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
149
click to vote
UAI
2008
15 years 5 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
124
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The blind beamforming method for constant modulus (CM) signals based on relevance vector machine (RVM) is proposed. The proposed beamforming method is obtained by incorporating th...
133
click to vote
JELIA
2004
Springer
15 years 9 months ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...