1242 search results - page 84 / 249 » A Computational Complexity Theory in Membrane Computing |
151
click to vote
ATAL
2001
Springer
15 years 10 months ago
2001
Springer
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
194
click to vote
EUROGP
2007
Springer
15 years 7 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
146
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
161
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
141
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...