Sciweavers

101 search results - page 8 / 21
» Efficient Cross-Validation in ILP
Sort
View
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
14 years 1 months ago
Lower-bound estimation for multi-bitwidth scheduling
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
Junjuan Xu, Jason Cong, Xu Cheng
ILP
2004
Springer
14 years 26 days ago
On the Effect of Caching in Recursive Theory Learning
This paper focuses on inductive learning of recursive logical theories from a set of examples. This is a complex task where the learning of one predicate definition should be inter...
Margherita Berardi, Antonio Varlaro, Donato Malerb...
ILP
2000
Springer
13 years 11 months ago
Learning First Order Logic Time Series Classifiers
A method for learning multivariate time series classifiers by inductive logic programming is presented. Two types of background predicate that are suited for this task are introduc...
Juan José Rodríguez, Carlos J. Alons...
EACL
2009
ACL Anthology
13 years 5 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
HPCA
2003
IEEE
14 years 7 months ago
Dynamic Data Dependence Tracking and its Application to Branch Prediction
To continue to improve processor performance, microarchitects seek to increase the effective instruction level parallelism (ILP) that can be exploited in applications. A fundament...
Lei Chen, Steve Dropsho, David H. Albonesi