Sciweavers

429 search results - page 31 / 86
» Turing computations on ordinals
Sort
View
AGI
2008
15 years 1 months ago
Participating in Cognition: The Interactive Search Optimization Algorithm
. We consider the Distributed Cognition paradigm as a framework for implementing artificial components of human cognition. We take email/internet search as a setting of distributed...
Nadav Abkasis, Israel Gottlieb, Eliraz Itzchaki
WSC
2007
15 years 2 months ago
Implications of heavy tails on simulation-based ordinal optimization
We consider the problem of selecting the best system using simulation-based ordinal optimization. This problem has been studied mostly in the context of light-tailed distributions...
Mark Broadie, Minsup Han, Assaf Zeevi
ICDM
2010
IEEE
132views Data Mining» more  ICDM 2010»
14 years 9 months ago
Monotone Relabeling in Ordinal Classification
In many applications of data mining we know beforehand that the response variable should be increasing (or decreasing) in the attributes. Such relations between response and attrib...
Ad Feelders
CIE
2010
Springer
14 years 10 months ago
Computability of Countable Subshifts
We investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor-Bendixson rank one contain only eventually periodic elements. Any ...
Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Seb...
MPC
2004
Springer
116views Mathematics» more  MPC 2004»
15 years 5 months ago
An Injective Language for Reversible Computation
Abstract. Erasure of information incurs an increase in entropy and dissipates heat. Therefore, information-preserving computation is essential for constructing computers that use e...
Shin-Cheng Mu, Zhenjiang Hu, Masato Takeichi