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

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

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...

2005
Andrzej Bednarski Christoph Kessler

To our knowledge there is only one Integer Linear Program ming ILP formulation in the literature that fully integrates all steps of code generation i e instruction selection register allocation and in struction scheduling on the basic block level We give in this paper an improved version of this ILP formulation that also covers VLIW proces sors Moreover our ILP formulation does no longer requir...

2014
Diana Andrea Fernandes de Abreu Antonio Caballero Pascal Fardel Nicholas Stroustrup Zhunan Chen KyungHwa Lee William D. Keyes Zachary M. Nash Isaac F. López-Moyado Federico Vaggi Astrid Cornils Martin Regenass Anca Neagu Ivan Ostojic Chang Liu Yongmin Cho Deniz Sifoglu Yu Shen Walter Fontana Hang Lu Attila Csikasz-Nagy Coleen T. Murphy Adam Antebi Eric Blanc Javier Apfeld Yun Zhang Joy Alcedo QueeLim Ch'ng

Insulin-like peptides (ILPs) play highly conserved roles in development and physiology. Most animal genomes encode multiple ILPs. Here we identify mechanisms for how the forty Caenorhabditis elegans ILPs coordinate diverse processes, including development, reproduction, longevity and several specific stress responses. Our systematic studies identify an ILP-based combinatorial code for these phe...

Journal: :Studia Logica 1991
Maarten de Rijke

Ill [6] Albert Visser shows that ILP completely axiomatizes all schemata about provabihty and relative interpretability that are prov-able in finitely axiomatized theories. In this paper we introduce a system called ILP ~ that completely axiomatizes the arithmetically valid principles of provability in and interpretabihty over such theories. To prove the arith-metical completeness of ILP ~ we u...

1998
Paulo F. Flores Horácio C. Neto Krishnendu Chakrabarty João P. Marques Silva

This paper addresses the problem of test pattern generation for single stuck-at faults in combinational circuits, under the additional constraint that the number of specified primary input assignments is minimized. This problem has different applications in testing, including the identification of don’t care conditions to be used in the synthesis of Built-In SelfTest (BIST) logic. The proposed ...

2015
Sebastiaan J. van Zelst Boudewijn F. van Dongen Wil M. P. van der Aalst

The language-based theory of regions, stemming from the area of Petri net synthesis, forms a fundamental basis for Integer Linear Programming (ILP)-based process discovery. Based on example behavior in an event log, a process model is derived that aims to describe the observed behavior. Building on top of the existing ILP-formulation, we present a new ILP-based process discovery formulation tha...

1999
Patrick Hung Michael J. Flynn

Modern superscalar and VLIW processors fetch, decode, issue, execute, and retire multiple instructions per cycle. By taking advantage of instruction-level parallelism (ILP), processor performance can be improved substantially. However, increasing the level of ILP may eventually result in diminishing and negative returns due to control and data dependencies among subsequent instructions as well ...

Journal: :Comput. J. 1998
Soo-Mook Moon Kemal Ebcioglu

Modern single-CPU microprocessors exploit instruction-level parallelism (ILP) by deriving their performance advantage mainly from parallel execution of ALU and memory instructions within a single clock cycle. This performance advantage obtained by exploiting data ILP is severely offset by sequential execution of conditional branches, especially in branch-intensive non-numerical code. Consequent...

2010
Jose Santos Stephen Muggleton

Entailment is an important problem in computational logic particularly relevant to the Inductive Logic Programming (ILP) community as it is at the core of the hypothesis coverage test which is often the bottleneck of an ILP system. Despite developments in resolution heuristics and, more recently, in subsumption engines, most ILP systems simply use Prolog’s left-to-right, depth-first search sele...

2004
Alexessander Alves Rui Camacho Eugenio Oliveira

This paper addresses the problem of data mining in Inductive Logic Programming (ILP) motivated by its application in the domain of economics. ILP systems have been largely applied to data mining classification tasks with a considerable success. The use of ILP systems in regression tasks has been far less successful. Current systems have very limited numerical reasoning capabilities, which limit...

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

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