608 search results - page 39 / 122 » On Dependent Randomized Rounding Algorithms |
AIRS
2006
Springer
15 years 4 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
100
Voted
AAAI
2007
15 years 2 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
143
Voted
MSWIM
2003
ACM
15 years 5 months ago
2003
ACM
Mobile Ad-Hoc Networks (MANETS) are networks of mobile nodes that do not have a fixed infrastructure. Recent research in this field addresses ways of solving existing problems i...
124
Voted
IEEEARES
2008
IEEE
15 years 6 months ago
2008
IEEE
We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B....
109
Voted
COMPGEOM
1996
ACM
15 years 4 months ago
1996
ACM
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...