Sciweavers

8825 search results - page 1495 / 1765
» All for one or one for all
Sort
View
ISCA
1995
IEEE
120views Hardware» more  ISCA 1995»
15 years 4 months ago
Streamlining Data Cache Access with Fast Address Calculation
For many programs, especially integer codes, untolerated load instruction latencies account for a significant portion of total execution time. In this paper, we present the desig...
Todd M. Austin, Dionisios N. Pnevmatikatos, Gurind...
VLDB
1995
ACM
89views Database» more  VLDB 1995»
15 years 4 months ago
OODB Bulk Loading Revisited: The Partitioned-List Approach
Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more com...
Janet L. Wiener, Jeffrey F. Naughton
INFOCOM
1991
IEEE
15 years 4 months ago
Queueing Performance with Impatient Customers
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
Zheng-Xue Zhao, Shivendra S. Panwar, Donald F. Tow...
GECCO
2010
Springer
248views Optimization» more  GECCO 2010»
15 years 4 months ago
Integrating decision space diversity into hypervolume-based multiobjective search
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
Tamara Ulrich, Johannes Bader, Eckart Zitzler
EDBT
2010
ACM
170views Database» more  EDBT 2010»
15 years 4 months ago
Augmenting OLAP exploration with dynamic advanced analytics
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
Benjamin Leonhardi, Bernhard Mitschang, Rubé...
« Prev « First page 1495 / 1765 Last » Next »