15033 search results - page 78 / 3007 » Complexity Theory and Algorithms |
139
Voted
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
118
Voted
PPSN
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
125
click to vote
INDOCRYPT
2001
Springer
15 years 8 months ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
139
Voted
FROCOS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
110
Voted
SIAMJO
2010
14 years 10 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...