Sciweavers

6276 search results - page 18 / 1256
» Exploring an information-based approach to computation and c...
Sort
View
APL
1998
ACM
13 years 12 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
ICRA
2005
IEEE
141views Robotics» more  ICRA 2005»
14 years 1 months ago
On Computing Complex Navigation Functions
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
Luciano C. A. Pimenta, Alexandre R. Fonseca, Guilh...
GRID
2005
Springer
14 years 1 months ago
SERVOGrid complexity computational environments (CCE) integrated performance analysis
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...
Galip Aydin, Mehmet S. Aktas, Geoffrey Fox, Harsha...
TARK
2009
Springer
14 years 2 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
IEAAIE
1998
Springer
13 years 12 months ago
Complexity and Cognitive Computing
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...
Lourdes Mattos Brasil, Fernando Mendes de Azevedo,...