Sciweavers

1197 search results - page 118 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
FOIKS
2008
Springer
13 years 9 months ago
Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
Henning Köhler
AAAI
2008
13 years 10 months ago
Perpetual Learning for Non-Cooperative Multiple Agents
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
Luke Dickens
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 1 months ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals
TMI
2008
116views more  TMI 2008»
13 years 8 months ago
Dynamic PET Reconstruction Using Wavelet Regularization With Adapted Basis Functions
Tomographic reconstruction from positron emission tomography (PET) data is an ill-posed problem that requires regularization. An attractive approach is to impose an 1-regularizatio...
J. Verhaeghe, Dimitri Van De Ville, I. Khalidov, Y...
CISS
2011
IEEE
12 years 12 months ago
Sparsity penalties in dynamical system estimation
—In this work we address the problem of state estimation in dynamical systems using recent developments in compressive sensing and sparse approximation. We formulate the traditio...
Adam Charles, Muhammad Salman Asif, Justin K. Romb...