Sciweavers

8109 search results - page 313 / 1622
» A Model of Component-Based Programming
Sort
View
LPNMR
1999
Springer
15 years 11 months ago
A Comparison of Sceptical NAF-Free Logic Programming Approaches
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, defau...
Grigoris Antoniou, Michael J. Maher, David Billing...
AAAI
2008
15 years 9 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu
NIPS
2007
15 years 8 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens
ANOR
2007
80views more  ANOR 2007»
15 years 6 months ago
Branch and bound, integer, and non-integer programming
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today - t...
John J. H. Forrest, John A. Tomlin
GPEM
2006
161views more  GPEM 2006»
15 years 6 months ago
Solving differential equations with genetic programming
A novel method for solving ordinary and partial differential equations, based on grammatical evolution is presented. The method forms generations of trial solutions expressed in an...
Ioannis G. Tsoulos, Isaac E. Lagaris