Sciweavers

431 search results - page 34 / 87
» The predictability of branches in libraries
Sort
View
ELPUB
2004
ACM
14 years 1 months ago
The need for sharing user-profiles in digital libraries
Personalization was a hype in the late 1990s. Several organizations offered (and are still offering) personalization services for their customers. From ecommerce applications we...
Harald Krottmaier
BIBE
2003
IEEE
133views Bioinformatics» more  BIBE 2003»
14 years 27 days ago
A Computational Pipeline for Protein Structure Prediction and Analysis at Genome Scale
The tertiary (3D) structure of a protein contains the essential information for understanding the biological function of the protein at the molecular and cellular levels. Traditio...
Manesh J. Shah, Sergei Passovets, Dongsup Kim, Kyl...
ISCA
1995
IEEE
110views Hardware» more  ISCA 1995»
13 years 11 months ago
Optimization of Instruction Fetch Mechanisms for High Issue Rates
Recent superscalar processors issue four instructions per cycle. These processors are also powered by highly-parallel superscalar cores. The potential performance can only be expl...
Thomas M. Conte, Kishore N. Menezes, Patrick M. Mi...
JSA
2008
142views more  JSA 2008»
13 years 7 months ago
A Java processor architecture for embedded real-time systems
Architectural advancements in modern processor designs increase average performance with features such as pipelines, caches, branch prediction, and out-of-order execution. However...
Martin Schoeberl
INFORMS
2006
87views more  INFORMS 2006»
13 years 7 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...