Sciweavers

7930 search results - page 88 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICNP
2006
IEEE
16 years 7 days ago
Reducing Congestion Effects in Wireless Networks by Multipath Routing
Abstract—We propose a solution to improve fairness and increase throughput in wireless networks with location information. Our approach consists of a multipath routing protocol, ...
Lucian Popa 0002, Costin Raiciu, Ion Stoica, David...
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 9 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
14 years 1 months ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...
JAIR
2010
165views more  JAIR 2010»
15 years 4 months ago
A Model-Based Active Testing Approach to Sequential Diagnosis
Model-based diagnostic reasoning often leads to a large number of diagnostic hypotheses. The set of diagnoses can be reduced by taking into account extra observations (passive mon...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
ANOR
2007
80views more  ANOR 2007»
15 years 6 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...