14779 search results - page 129 / 2956 » On Ultrametric Algorithmic Information |
AAAI
1990
15 years 1 months ago
1990
This paper studies sorted generalization-the generalization, with respect to an arbitrary taxonomic theory, of atomic formulas containing sorted variables. It develops an algorith...
104
click to vote
JCO
2007
14 years 11 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
The existence of efficient algorithms to compute the eigenvectors and eigenvalues of graphs supplies a useful tool for the design of various graph algorithms. In this survey we de...
AIRS
2005
Springer
15 years 1 months ago
2005
Springer
Abstract. We propose a new clustering algorithm satisfying requirements for the post-clustering algorithms as many as possible. The proposed “Fuzzy Concept ART” is the form of ...
EKAW
2004
Springer
15 years 5 months ago
2004
Springer
A new incremental knowledge acquisition approach for the effective development of efficient problem solvers for combinatorial problems based on probabilistic search algorithms is ...