1568 search results - page 33 / 314 » The problem of examination questions in algorithmics |
141
click to vote
SSS
2007
Springer
15 years 11 months ago
2007
Springer
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
153
click to vote
ALGORITHMICA
1999
15 years 5 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
157
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
162
click to vote
CSJM
2006
15 years 5 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
138
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Using a recent idea of Gaudry and exploiting rational representations of algebraic tori, we present an index calculus type algorithm for solving the discrete logarithm pr...