Sciweavers

1265 search results - page 150 / 253
» Performance Measurement of Interpreted Programs
Sort
View
ILP
2003
Springer
14 years 2 months ago
ILP for Mathematical Discovery
We believe that AI programs written for discovery tasks will need to simultaneously employ a variety of reasoning techniques such as induction, abduction, deduction, calculation an...
Simon Colton, Stephen Muggleton
IWAN
1999
Springer
14 years 1 months ago
Policy Specification for Programmable Networks
There is a need to be able to program network components to adapt to application requirements for quality of service, specialised application dependent routing, to increase effici...
Morris Sloman, Emil Lupu
CAV
2009
Springer
123views Hardware» more  CAV 2009»
14 years 25 days ago
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
David Monniaux
DAGSTUHL
1996
13 years 10 months ago
A Self-Applicable Supercompiler
A supercompiler is a program which can performa deep transformation of programsusing a principle which is similarto partial evaluation, and can be referred to as metacomputation. ...
Andrei P. Nemytykh, Victoria A. Pinchuk, Valentin ...
IJCAI
1989
13 years 10 months ago
A Modest, but Semantically Well Founded, Inheritance Reasoner
A modest exception allowing inheritance reasoner is presented. The reasoner allows restricted, but semantically well founded, defeasible property inheritance. Furthermore, it give...
Fahiem Bacchus