2490 search results - page 102 / 498 » Complexity of Contextual Reasoning |
154
click to vote
KI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. There is a growing research interest in the design of competitive and adaptive Game AI for complex computer strategy games. In this paper, we present a novel approach for...
107
click to vote
ICRA
2010
IEEE
15 years 2 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...
107
click to vote
CCA
2009
Springer
15 years 11 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...
132
click to vote
IWSEC
2009
Springer
15 years 11 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 ...
157
click to vote
LPAR
2007
Springer
15 years 10 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 ...