Sciweavers

6274 search results - page 105 / 1255
» From query complexity to computational complexity
Sort
View
153
Voted
KI
2008
Springer
15 years 3 months ago
Learning by Observing: Case-Based Decision Making in Complex Strategy Games
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...
Darko Obradovic, Armin Stahl
JACM
2002
122views more  JACM 2002»
15 years 3 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
15 years 2 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— 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...
Feili Hou, Wei-Min Shen
PCM
2010
Springer
239views Multimedia» more  PCM 2010»
15 years 1 months ago
Adaptive Particle Filter Based on Energy Field for Robust Object Tracking in Complex Scenes
Particle filter (PF) based object tracking methods have been widely used in computer vision. However, traditional particle filter trackers cannot effectively distinguish the target...
Xin Sun, Hongxun Yao, Shengping Zhang, Shaohui Liu
NFM
2011
335views Formal Methods» more  NFM 2011»
14 years 10 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...