Sciweavers

3422 search results - page 399 / 685
» Random Subset Optimization
Sort
View
PIMRC
2008
IEEE
15 years 10 months ago
Comparative performance evaluation of MAC protocols in ad hoc networks with bandwidth partitioning
—This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In t...
Mariam Kaynia, Geir E. Øien, Nihar Jindal, ...
CEC
2007
IEEE
15 years 10 months ago
An investigation into dynamic problem solving in a hybrid evolutionary market-based multi-agent system
— Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem specifications, con...
D. J. Cornforth
AE
2005
Springer
15 years 9 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud
ICALP
2003
Springer
15 years 9 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
ITC
1998
IEEE
114views Hardware» more  ITC 1998»
15 years 8 months ago
BETSY: synthesizing circuits for a specified BIST environment
This paper presents a logic synthesis tool called BETSY (BIST Environment Testable Synthesis) for synthesizing circuits that achieve complete (100%)fault coverage in a user specif...
Zhe Zhao, Bahram Pouya, Nur A. Touba