نتایج جستجو برای: ilp assessment

تعداد نتایج: 563733  

1995
Hilde Adé Marc Denecker

Inductive Logic Programming (ILP) is often situated as a research area emerging at the intersection of Machine Learning and Logic Programming (LP) This paper makes the link more clear between ILP and LP, in particular, between ILP and Abductive Logic Programming (ALP), 1 e , LP extended with abductive reasoning We formulate a generic framework for handling incomplete knowledge This framework ca...

2009
Kallirroi Georgila

We present a novel two-stage technique for detecting speech disfluencies based on Integer Linear Programming (ILP). In the first stage we use state-of-the-art models for speech disfluency detection, in particular, hidden-event language models, maximum entropy models and conditional random fields. During testing each model proposes possible disfluency labels which are then assessed in the presen...

2007
Rajeev Kumar Gajbhiye

We propose an integer linear programming (ILP) formulation for the minimum relay break point set (BPS) computation. Subsequently, in the ILP framework, we propose an alternate maximum-independent relay BPS formulation with the intention of minimizing dependency within the BPS. We show that 1) in practice, the relaxed version of the ILP suffices to obtain an integral vertex and 2) the relaxed ve...

2002
Stasinos Konstantopoulos

This is to present work on applying Inductive Logic Programming (ILP) to the task of BaseNP chunking. After ILP and NP Chunking are discussed, the experimental setup for using ILP to construct a BaseNP tagger in Prolog is described. Finally, the results are quantitatively as well as qualitatively analysed.

2015

K – Survey of Instruction Set Architectures related to instruction-, data-, thread-, and requestlevel parallelism necessary for understanding Loop unrolling. ILP, Compiler techniques to increase ILP. Register Renaming, Pipeline Scheduling, Loop Unrolling. Conclusion. CPE 731, ILP. 3. Instruction Level Parallelism. 5 Optimizing Program Performance(Loop Unrolling and Enhancing Parallelism ) Michael.

2006
Andrzej Bednarski Christoph W. Kessler

We give an Integer Linear Programming (ILP) solution that fully integrates all steps of code generation, i.e. instruction selection, register allocation and instruction scheduling, on the basic block level for VLIW processors. In earlier work, we contributed a dynamic programming (DP) based method for optimal integrated code generation, implemented in our retargetable code generator OPTIMIST. I...

2011
Soban Umar Rangarajan D. Nadadur Jingyuan Li Federica Maltese Parisa Partownavid Arnoud van der Laarse Mansoureh Eghbali

Pulmonary arterial hypertension (PAH) is characterized by pulmonary vascular remodeling leading to right ventricular (RV) hypertrophy and failure. Intralipid (ILP), a source of parenteral nutrition for patients, contains -linolenic acid and soy-derived phytoestrogens that are protective for lungs and heart. We, therefore, investigated the therapeutic potential of ILP in preventing and rescuing ...

1998
Francisca Quintana Roger Espasa Mateo Valero

This report presents a new architecture based on addding a vector pipeline to a superscalar microprocessor. The goal of this paper is to show that instruction-level parallelism (ILP) and data-level parallelism (DLP) can be merged in a single architecture to execute regular vectorizable code at a performance level that can not be achieved using only ILP techniques. We present an analysis of the ...

2010
Trevor Walker Ciaran O'Reilly Gautam Kunapuli Sriraam Natarajan Richard Maclin David Page Jude W. Shavlik

Inductive Logic Programming (ILP) provides an effective method of learning logical theories given a set of positive examples, a set of negative examples, a corpus of background knowledge, and specification of a search space (e.g., via mode definitions) from which to compose the theories. While specifying positive and negative examples is relatively straightforward, composing effective backgroun...

2008
Ana Graça Inês Lynce João Marques-Silva Arlindo L. Oliveira

Haplotype inference is an important and computationally challenging problem in genetics. A well-known approach to haplotype inference is pure parsimony (HIPP). Despite being based on a simple optimization criterion, HIPP is a computationally hard problem. Recent work has shown that approaches based on Boolean satisfiability namely pseudo-Boolean optimization (PBO), are very effective at tacklin...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید