Sciweavers

405 search results - page 56 / 81
» Random Number Selection in Self-assembly
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 2 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
SIGSOFT
1995
ACM
14 years 13 days ago
An Experiment to Assess the Cost-Benefits of Code Inspections in Large Scale Software Development
—We conducted a long-term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to ...
Adam A. Porter, Harvey P. Siy, Carol A. Toman, Law...
ATAL
2010
Springer
13 years 10 months ago
On the limits of dictatorial classification
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
BMCBI
2005
152views more  BMCBI 2005»
13 years 8 months ago
Ranking the whole MEDLINE database according to a large training set using text indexing
Background: The MEDLINE database contains over 12 million references to scientific literature, ut 3/4 of recent articles including an abstract of the publication. Retrieval of ent...
Brian P. Suomela, Miguel A. Andrade
INFOCOM
2005
IEEE
14 years 2 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...