Sciweavers

8413 search results - page 1026 / 1683
» Ordering Problem Subgoals
Sort
View
CONCUR
1998
Springer
15 years 11 months ago
On Discretization of Delays in Timed Automata and Digital Circuits
In this paper we solve the following problem: \given a digital circuit composed of gates whose real-valued delays are in an integerbounded interval, is there a way to discretize ti...
Eugene Asarin, Oded Maler, Amir Pnueli
CONCUR
1997
Springer
15 years 11 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
LPKR
1997
Springer
15 years 11 months ago
A System for Abductive Learning of Logic Programs
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...
SC
1994
ACM
15 years 11 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 11 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
« Prev « First page 1026 / 1683 Last » Next »