4451 search results - page 454 / 891 » On Random Ordering Constraints |
169
click to vote
COMGEO
2010
ACM
15 years 7 months ago
2010
ACM
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
138
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
: In this paper, our focus is on certain applications for mobile robotic networks, where reconfiguration is driven by factors intrinsic to the network rather than changes in the ex...
159
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The cross-entropy method (CE) developed by R. Rubinstein is an elegant practical principle for simulating rare events. The method approximates the probability of the rare event by...
177
click to vote
FUIN
2006
15 years 6 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
160
click to vote
IJOE
2006
15 years 6 months ago
2006
The objective of this paper is to emphasize a clear and natural distinction in strategies of sensor network design. In order to display different architectural paradigms in today&#...