Sciweavers

181 search results - page 13 / 37
» Binary Change Set Composition
Sort
View
OOPSLA
2010
Springer
13 years 6 months ago
Refactoring references for library migration
This report is a companion to the paper “Refactoring References for Library Migration” published at the ACM SIGPLAN International Conference on Systems, Programming, Languages...
Puneet Kapur, Bradley Cossette, Robert J. Walker
COCO
1992
Springer
82views Algorithms» more  COCO 1992»
13 years 11 months ago
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
Stephen A. Bloch
CRIWG
2001
13 years 9 months ago
Evolution in Use of Groupware: Facilitating Tailoring to the Extreme
Group work evolves, often leading to changing requirements on the technical support. To meet these new requirements groupware has to be modified. A system that allows end users to...
Robert Slagter, Margit Biemans, G. Henri ter Hofte
OTM
2010
Springer
13 years 5 months ago
Composing Near-Optimal Expert Teams: A Trade-Off between Skills and Connectivity
Abstract. Rapidly changing business requirements necessitate the adhoc composition of expert teams to handle complex business cases. Expertcentric properties such as skills, howeve...
Christoph Dorn, Schahram Dustdar
AINA
2010
IEEE
14 years 19 days ago
Grid of Segment Trees for Packet Classification
—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should b...
Yeim-Kuan Chang, Yung-Chieh Lin, Chen-Yu Lin