556 search results - page 98 / 112 » Pair Programming: Not for Everyone |
KDD
2009
ACM
14 years 9 days ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
SAS
2001
Springer
14 years 5 days ago
2001
Springer
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
ISPD
2000
ACM
14 years 3 days ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
ICCAD
1999
IEEE
14 years 1 days ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
SE
2007
13 years 9 months ago
2007
Abstract: Die im folgenden vorgestellte Diplomarbeit legt den theoretischen Rahmen f¨ur die verteilte Paarprogrammierung als Weiterentwicklung der klassischen Paarprogrammierung u...