Sciweavers

2693 search results - page 105 / 539
» On Computing Complex Navigation Functions
Sort
View
AML
1999
86views more  AML 1999»
13 years 9 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
COMPGEOM
2009
ACM
14 years 4 months ago
Zigzag persistent homology and real-valued functions
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
Gunnar Carlsson, Vin de Silva, Dmitriy Morozov
INTERACTION
2009
ACM
14 years 4 months ago
A binary method for fast computation of inter and intra cluster similarities for combining multiple clusterings
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
Selim Mimaroglu, A. Murat Yagci
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
14 years 1 months ago
Classifier systems that compute action mappings
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
Pier Luca Lanzi, Daniele Loiacono
ERSA
2007
88views Hardware» more  ERSA 2007»
13 years 11 months ago
Autonomous Computing Systems: A Proposed Roadmap
An autonomous computing system is a system that functions with a large degree of independence, and assumes a large amount of responsibility for its own resources and operation. As...
Neil Steiner, Peter Athanas