Sciweavers

2720 search results - page 7 / 544
» How do we count
Sort
View
DAC
2004
ACM
13 years 11 months 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
AGILEDC
2007
IEEE
14 years 1 months ago
How We Made Onsite Customer Work - An Extreme Success Story
The Agile Manifesto emphasizes customer collaboration over contract negotiation. No Extreme Programming practice embodies this more than onsite customer. This paper describes our ...
Michelle Williams, Jay Packlick, Rajeev Bellubbi, ...
CHI
2007
ACM
13 years 11 months ago
"Get real!": what's wrong with hci prototyping and how can we fix it?
A prototype of computing technology--as a means to evaluate and communicate a good idea--is often an essential step towards useful, shipping products and towards a deeper understa...
William Jones, Jared M. Spool, Jonathan Grudin, Vi...
PDC
2004
ACM
14 years 24 days ago
Examining a planning discourse: how a manager represents issues within a planning frame and how the others could do the same
The aim of Participatory Design (PD) is to involve the users in the design. Even though the research has shown the success of PD projects in empowering users, little has been said...
Jarmo Sarkkinen
DCG
2008
93views more  DCG 2008»
13 years 7 months ago
Odd Crossing Number and Crossing Number Are Not the Same
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...