Sciweavers

4193 search results - page 96 / 839
» Measurable Categories
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 5 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon
ATAL
2003
Springer
15 years 5 months ago
A preliminary taxonomy of multi-agent interactions
Discussions of agent interactions frequently characterize behavior as “coherent,” “collaborative,” “cooperative,” “competitive,” or “coordinated.” We propose a...
H. Van Dyke Parunak, Sven Brueckner, Mitchell Flei...
ICSE
2005
IEEE-ACM
15 years 12 months ago
Beyond computer science
Computer science is necessary but not sufficient to understand and overcome the problems we face in software engineering. We need to understand not only the properties of the soft...
James D. Herbsleb
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 5 months ago
Post-processing clustering to reduce XCS variability
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
Flavio Baronti, Alessandro Passaro, Antonina Stari...
ESEM
2008
ACM
15 years 1 months ago
An empirical model to predict security vulnerabilities using code complexity metrics
Complexity is often hypothesized to be the enemy of software security. If this hypothesis is true, complexity metrics may be used to predict the locale of security problems and ca...
Yonghee Shin, Laurie Williams