Sciweavers

17366 search results - page 168 / 3474
» New Revision Algorithms
Sort
View
EVOW
2010
Springer
15 years 10 months ago
A New Selection Ratio for Large Population Sizes
Abstract. Motivated by parallel optimization, we study the SelfAdaptation algorithm for large population sizes. We first show that the current version of this algorithm does not r...
Fabien Teytaud
ISPEC
2005
Springer
15 years 9 months ago
A New Class of Codes for Fingerprinting Schemes
Abstract. In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be u...
Marcel Fernandez, Miguel Soriano, Josep Cotrina Na...
FSE
2003
Springer
135views Cryptology» more  FSE 2003»
15 years 9 months ago
New Attacks against Standardized MACs
In this paper, we revisit the security of several message authentication code (MAC) algorithms based on block ciphers, when instantiated with 64-bit block ciphers such as DES. We e...
Antoine Joux, Guillaume Poupard, Jacques Stern
PDPTA
2004
15 years 5 months ago
A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...
Zhengnan Shi, Pradip K. Srimani
CORR
2007
Springer
181views Education» more  CORR 2007»
15 years 4 months ago
A new lower bound on the independence number of a graph
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
Ossama Kettani