Sciweavers

590 search results - page 76 / 118
» From Relational Specifications to Logic Programs
Sort
View

Lecture Notes
1005views
15 years 9 months ago
Lectures on reconfigurable computing
Driven by recent innovations in Field-Programmable Gate Arrays (FPGAs), reconfigurable computing offers unique ways to accelerate key algorithms. FPGAs offer a programmable logic f...
Sherief Reda
EUROSSC
2007
Springer
14 years 3 months ago
Capturing Context Requirements
Context-aware applications require context information to adapt their behaviour to the current situation. When developing context-aware applications, application developers need to...
Tom Broens, Dick A. C. Quartel, Marten van Sindere...
JDCTA
2010
150views more  JDCTA 2010»
13 years 3 months ago
Proof as Composition: An approach for the Large-granularity Web Services Composition
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...
Yuyu Yin, Ying Li, Jianwei Yin, ShuiGuang Deng
AGP
1994
IEEE
14 years 29 days ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen