Results 271 to 280 of about 696,423 (315)
Some of the next articles are maybe not open access.
Branch Runahead: An Alternative to Branch Prediction for Impossible to Predict Branches
MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture, 2021High performance microprocessors require high levels of instruction supply. Branch prediction has been the most important driver of this for nearly 30 years. Unfortunately, modern predictors are increasingly bottlenecked by hard-to-predict data-dependent branches that fundamentally cannot be predicted via a history based approach.
Stephen Pruett, Yale N. Patt
openaire +1 more source
To branch or not to branch that is the question
2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW), 2013One of the most contentious areas in software development is branching. Proponents of agile development methodologies are often against the concept of branching as a matter of principle, other large software development projects, such as Windows, are heavy users of branches to control the software generated by thousands of its engineers.
Brendan Murphy, Laurie A. Williams
openaire +1 more source
Mathematical Programming, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Ostrowski 0001 +3 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Ostrowski 0001 +3 more
openaire +3 more sources
Mathematical Programming, 2003
The paper offers another complete branching scheme to solve Mixed-Integer-Programs (MIP). The main idea is to favor early updates of the incumbent solution, producing improved solutions in early stages of the computation. This is intended by adding linear soft fixing constraints: linear inequalities, by which the relative number \(r\) of flipping ...
Fischetti M., Lodi A.
openaire +2 more sources
The paper offers another complete branching scheme to solve Mixed-Integer-Programs (MIP). The main idea is to favor early updates of the incumbent solution, producing improved solutions in early stages of the computation. This is intended by adding linear soft fixing constraints: linear inequalities, by which the relative number \(r\) of flipping ...
Fischetti M., Lodi A.
openaire +2 more sources
On the Branch Points in the Branched Coverings of Links
Canadian Mathematical Bulletin, 1985AbstractLet l be a polygonal link in a 3-sphere S3 and a branched covering of l, which depends on the choice of a monodromy map ϕ. Let be the link in over l. In this paper we determine the exact position of in for some cases. For instance, if l is a torus link ((n + 1)p, n) and ϕ is an appropriate monodromy map of the fundamental group of S3 - l ...
openaire +1 more source
Annual Review of Plant Biology, 2005
All plant shoots can be described as a series of developmental modules termed phytomers, which are produced from shoot apical meristems. A phytomer generally consists of a leaf, a stem segment, and a secondary shoot meristem. The fate and activity adopted by these secondary, axillary shoot meristems is the major source of evolutionary and ...
Paula, McSteen, Ottoline, Leyser
openaire +2 more sources
All plant shoots can be described as a series of developmental modules termed phytomers, which are produced from shoot apical meristems. A phytomer generally consists of a leaf, a stem segment, and a secondary shoot meristem. The fate and activity adopted by these secondary, axillary shoot meristems is the major source of evolutionary and ...
Paula, McSteen, Ottoline, Leyser
openaire +2 more sources
Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization, 2008
We propose a new instruction, branch-on-random, that is like a standard conditional branch, except rather than specifying the condition on which the branch should be taken, it specifies a frequency at which the branch should be taken. We show that branch-on-random is useful for reducing the overhead of program instrumentation, via sampling ...
Edward Lee, Craig B. Zilles
openaire +1 more source
We propose a new instruction, branch-on-random, that is like a standard conditional branch, except rather than specifying the condition on which the branch should be taken, it specifies a frequency at which the branch should be taken. We show that branch-on-random is useful for reducing the overhead of program instrumentation, via sampling ...
Edward Lee, Craig B. Zilles
openaire +1 more source
BioEssays, 1987
AbstractThe only RNA molecules known to be branched are circular structures with tails known as lariats that arise during nuclear pre‐mRNA splicing. Lariats accumulate within a large multicomponent particle called a spliceosome that forms upon the addition of unspliced mRNA to nuclear extracts.
openaire +2 more sources
AbstractThe only RNA molecules known to be branched are circular structures with tails known as lariats that arise during nuclear pre‐mRNA splicing. Lariats accumulate within a large multicomponent particle called a spliceosome that forms upon the addition of unspliced mRNA to nuclear extracts.
openaire +2 more sources
2005
Allen's interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restricted to domains that deal with linear flows of time. But how the fundamental ideas of Allen's calculus can be extended to other, weaker structures than linear orders has gained ...
Marco Ragni, Stefan Wölfl 0001
openaire +2 more sources
Allen's interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restricted to domains that deal with linear flows of time. But how the fundamental ideas of Allen's calculus can be extended to other, weaker structures than linear orders has gained ...
Marco Ragni, Stefan Wölfl 0001
openaire +2 more sources