Sciweavers

55 search results - page 10 / 11
» Inductive Consequences in the Calculus of Constructions
Sort
View
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 7 months ago
Explicit factors of some iterated resultants and discriminants
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
Laurent Busé, Bernard Mourrain
ICFP
2006
ACM
14 years 7 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
SOFTCO
2004
Springer
14 years 1 months ago
Designing Neural Networks Using Gene Expression Programming
Abstract. An artificial neural network with all its elements is a rather complex structure, not easily constructed and/or trained to perform a particular task. Consequently, severa...
Cândida Ferreira
JMLR
2011
117views more  JMLR 2011»
13 years 2 months ago
Parameter Screening and Optimisation for ILP using Designed Experiments
Reports of experiments conducted with an Inductive Logic Programming system rarely describe how specific values of parameters of the system are arrived at when constructing model...
Ashwin Srinivasan, Ganesh Ramakrishnan
CSL
2007
Springer
14 years 1 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin