Sciweavers

3693 search results - page 570 / 739
» Splitting a Logic Program
Sort
View
CDES
2008
90views Hardware» more  CDES 2008»
13 years 9 months ago
Nanocompilation for the Cell Matrix Architecture
- The Cell Matrix Architecture is a massive array of dynamically self-configurable, uniformly connected, identical computational units. This architecture can enable efficient, prac...
Thomas Way, Rushikesh Katikar, Ch. Purushotham
VDB
1998
169views Database» more  VDB 1998»
13 years 9 months ago
What You See is What You Store: Database-Driven Interfaces
Any graphical user interface (GUI) requires large amounts of complex metadata for the layout of windows and menus, their style and behavior, their bindings, etc. Designing, debugg...
Jens Thamm, Lutz Michael Wegner
AAAI
1990
13 years 9 months ago
Operationality Criteria for Recursive Predicates
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
Stanley Letovsky
APAL
2008
104views more  APAL 2008»
13 years 8 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
ENTCS
2006
123views more  ENTCS 2006»
13 years 8 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond