Sciweavers

20294 search results - page 124 / 4059
» Algorithmic Information Theory
Sort
View
ICTAI
2010
IEEE
15 years 2 months ago
Revision Rules in the Theory of Evidence
Abstract--Combination rules proposed so far in the DempsterShafer theory of evidence, especially Dempster rule, rely on a basic assumption, that is, pieces of evidence being combin...
Jianbing Ma, Weiru Liu, Didier Dubois, Henri Prade
MKM
2007
Springer
15 years 10 months ago
Formal Representation of Mathematics in a Dependently Typed Set Theory
Abstract. We have formalized material from an introductory real analysis textbook in the proof assistant Scunak. Scunak is a system based on set theory encoded in a dependent type ...
Feryal Fulya Horozal, Chad E. Brown
ECTEL
2006
Springer
15 years 8 months ago
Ontological Support for a Theory-Eclectic Approach to Instructional and Learning Design
Enhancement of learning with technology has been accelerating thanks to the advancement of information technology (IT) and the development of IT standards for learning. The purpose...
Yusuke Hayashi, Jacqueline Bourdeau, Riichiro Mizo...
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
15 years 10 months ago
Choreogenetics: the generation of choreographic variants through genetic mutations and selection
In this paper, a genetic algorithm is introduced to generate variants of a choreographic sequence, which are then selected using different criteria. The mutation phase of the algo...
François-Joseph Lapointe
COLING
1990
15 years 5 months ago
A Computational Approach to Binding Theory
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
Alessandra Giorgi, Fabio Pianesi, Giorgio Satta