Sciweavers

1871 search results - page 7 / 375
» The Ephemeral Pairing Problem
Sort
View
GECCO
2005
Springer
137views Optimization» more  GECCO 2005»
14 years 27 days ago
Constant generation for the financial domain using grammatical evolution
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
Ian Dempsey
AEI
2008
118views more  AEI 2008»
13 years 7 months ago
An approach to accessing product data across system and software revisions
Long-term users of engineering product data are hampered by the ephemeral nature of CAD file formats and the applications that work with them. STEP, the Standard for the Exchange ...
Alexander Ball, Lian Ding, Manjula Patel
CEC
2008
IEEE
14 years 1 months ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...
TIT
2008
93views more  TIT 2008»
13 years 7 months ago
Aspects of Pairing Inversion
Abstract. We discuss some applications of the pairing inversion problem and outline some potential approaches for solving it. Our analysis of these approaches gives further evidenc...
Steven D. Galbraith, Florian Hess, Frederik Vercau...
ALGORITHMICA
2011
13 years 2 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick