Sciweavers

1802 search results - page 159 / 361
» Complexity Theory for Operators in Analysis
Sort
View
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 12 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
ATAL
2008
Springer
15 years 8 months ago
Structure in threes: modelling organization-oriented software architectures built upon multi-agent systems
Software systems are subject to increasing complexity and in need of efficient structuring. Multi-agent system research has come up with approaches for an organization-oriented co...
Matthias Wester-Ebbinghaus, Daniel Moldt
URBAN
2008
128views more  URBAN 2008»
15 years 6 months ago
Discerning landslide susceptibility using rough sets
Rough set theory has been primarily known as a mathematical approach for analysis of a vague description of objects. This paper explores the use of rough set theory to manage the ...
Pece V. Gorsevski, Piotr Jankowski
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
16 years 28 days ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
16 years 18 days ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett