Sciweavers

12697 search results - page 2305 / 2540
» Call for Papers
Sort
View
ESOP
2007
Springer
15 years 7 months ago
On the Implementation of Construction Functions for Non-free Concrete Data Types
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
Frédéric Blanqui, Thérè...
FC
2007
Springer
125views Cryptology» more  FC 2007»
15 years 7 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
99
Voted
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
15 years 7 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 7 months ago
SDR: a better trigger for adaptive variance scaling in normal EDAs
Recently, advances have been made in continuous, normal– distribution–based Estimation–of–Distribution Algorithms (EDAs) by scaling the variance up from the maximum–like...
Peter A. N. Bosman, Jörn Grahl, Franz Rothlau...
102
Voted
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 7 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
« Prev « First page 2305 / 2540 Last » Next »