Maximum Commonality Problems: Applications and Analysis

Recently, an agile software development technique called extreme programming has caught the attention of practitioners and researchers in the software industry. A core practice of extreme programming is pair programming , where two developers work on the same piece of code. We introduce the problem...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Management science Ročník 54; číslo 1; s. 194 - 207
Hlavní autoři:	Dawande, Milind, Kumar, Subodha, Mookerjee, Vijay, Sriskandarajah, Chelliah
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Linthicum, MD INFORMS 01.01.2008 Institute for Operations Research and the Management Sciences
Edice:	Management Science
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms analysis of algorithms applications Applied sciences Approximation Business studies Cardinality Computational complexity Computer programming Computer science; control theory; systems Computer software Computer systems and distributed systems. User interface Exact sciences and technology Graphs Innovation Integer programming Integers Management science Personnel management Programming Social aspects Software Software engineering Software industry Studies suboptimal algorithms Systems development Theoretical computing Trees Variants Writers Zero United States Tree(graph) Software development analysis of algorithms Polynomial approximation Duration Graph theory Polynomial method Approximation algorithm Extreme programming Computational complexity Polynomial time Integer programming suboptimal algorithms Extreme value Dissemination NP complete problem Agile programming Load balancing Algorithm analysis Completion time Execution time applications
ISSN:	0025-1909, 1526-5501
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!