Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
16
search results - page 4 / 4
»
Distribution-Free Testing Lower Bounds for Basic Boolean Fun...
Sort
relevance
views
votes
recent
update
View
thumb
title
12
click to vote
TCS
2010
141
views
Theoretical Computer Science
»
more
TCS 2010
»
Runtime analysis of a binary particle swarm optimizer
13 years 3 months ago
Download
ls2-www.cs.tu-dortmund.de
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt
claim paper
Read More »
« Prev
« First
page 4 / 4
Last »
Next »