1568 search results - page 149 / 314 » The problem of examination questions in algorithmics |
128
click to vote
SAGT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
136
click to vote
IMC
2003
ACM
15 years 10 months ago
2003
ACM
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
231
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
156
click to vote
ASIACRYPT
2009
Springer
15 years 11 months ago
2009
Springer
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
143
click to vote
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Wireless sensor networks have recently been suggested for many surveillance applications such as object monitoring, path protection, or area coverage. Since the sensors themselves...