2214 search results - page 70 / 443 » Complexity of Reasoning |
100
click to vote
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
CCA
2009
Springer
15 years 9 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...
118
click to vote
IWSEC
2009
Springer
15 years 9 months ago
2009
Springer
Reducing the minimum assumptions needed to construct various cryptographic primitives is an important and interesting task in theoretical cryptography. Oblivious Transfer, one of ...
139
click to vote
LPAR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
101
click to vote
RSFDGRC
2005
Springer
15 years 8 months ago
2005
Springer
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...