Sciweavers

5326 search results - page 8 / 1066
» On what we can ensure
Sort
View
DAC
2004
ACM
14 years 6 days ago
Practical repeater insertion for low power: what repeater library do we need?
In this paper, we investigate the problem of repeater insertion for low power under a given timing budget. We propose a novel repeater insertion algorithm to compute the optimal r...
Xun Liu, Yuantao Peng, Marios C. Papaefthymiou
SIGIR
2002
ACM
13 years 8 months ago
Analysis of papers from twenty-five years of SIGIR conferences: what have we been doing for the last quarter of a century?
mes, abstracts and year of publication of all 853 papers published.1 We then applied Porter stemming and stopword removal to this text, represented terms from the elds with twice t...
Alan F. Smeaton, Gary Keogh, Cathal Gurrin, Kieran...
SIGMOD
2008
ACM
190views Database» more  SIGMOD 2008»
14 years 8 months ago
OLTP through the looking glass, and what we found there
Online Transaction Processing (OLTP) databases include a suite of features -- disk-resident B-trees and heap files, locking-based concurrency control, support for multi-threading ...
Stavros Harizopoulos, Daniel J. Abadi, Samuel Madd...
ICSE
2009
IEEE-ACM
14 years 9 months ago
How we refactor, and how we know it
Much of what we know about how programmers refactor in the wild is based on studies that examine just a few software projects. Researchers have rarely taken the time to replicate ...
Emerson R. Murphy-Hill, Chris Parnin, Andrew P. Bl...
ALS
2003
Springer
14 years 1 months ago
Not Everything We Know We Learned
This is foremost a methodological contribution. It focuses on the foundation of anticipation and the pertinent implications that anticipation has on learning (theory and experiment...
Mihai Nadin