Sciweavers

628 search results - page 84 / 126
» Magic Counting Methods
Sort
View
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 2 months ago
Learning building block structure from crossover failure
In the classical binary genetic algorithm, although crossover within a building block (BB) does not always cause a decrease in fitness, any decrease in fitness results from the ...
Zhenhua Li, Erik D. Goodman
GLOBECOM
2006
IEEE
14 years 2 months ago
Position-based Routing using Virtual Small World in MANETs
— Routing is the foremost issue in mobile ad hoc networks (MANETs), In a wireless environment characterized by small bandwidth and limited computation resources, positionbased ro...
Cong Liu, Jie Wu
PPOPP
2006
ACM
14 years 1 months ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski
DFT
2005
IEEE
83views VLSI» more  DFT 2005»
14 years 1 months ago
An ILP Formulation for Yield-driven Architectural Synthesis
Data flow graph dominant designs, such as communication video and audio applications, are common in today’s IC industry. In these designs, the datapath resources (e.g., adders,...
Zhaojun Wo, Israel Koren, Maciej J. Ciesielski
EUROCRYPT
2001
Springer
14 years 14 days ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley