Sciweavers

4372 search results - page 33 / 875
» Algorithmic Theories of Everything
Sort
View
ICAIL
2003
ACM
14 years 1 months ago
Induction of Defeasible Logic Theories in the Legal Domain
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
Benjamin Johnston, Guido Governatori
ISSAC
2005
Springer
70views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Approximation of dynamical systems using s-systems theory: application to biological systems
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...
Laurent Tournier
ISCI
2008
88views more  ISCI 2008»
13 years 8 months ago
Greedy regression ensemble selection: Theory and an application to water quality prediction
This paper studies the greedy ensemble selection family of algorithms for ensembles of regression models. These algorithms search for the globally best subset of regresmaking loca...
Ioannis Partalas, Grigorios Tsoumakas, Evaggelos V...
RECOMB
2006
Springer
14 years 9 months ago
Sorting by Translocations Via Reversals Theory
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
Michal Ozery-Flato, Ron Shamir
COLING
1990
13 years 9 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