Sciweavers

1399 search results - page 101 / 280
» New Algorithms for k-Center and Extensions
Sort
View
IJCAI
2003
13 years 10 months ago
A General Model for Online Probabilistic Plan Recognition
We present a new general framework for online istic plan recognition called the Abstract Hidden Markov Memory Model (AHMEM). The l is an extension of the existing Abstract Hidden ...
Hung Hai Bui
ICASSP
2010
IEEE
13 years 9 months ago
NMF with time-frequency activations to model non stationary audio events
Real world sounds often exhibit non-stationary spectral characteristics such as those produced by a harpsichord or a guitar. The classical Non-negative Matrix Factorization (NMF) ...
Romain Hennequin, Roland Badeau, Bertrand David
IPL
2008
95views more  IPL 2008»
13 years 9 months ago
The Generalized Maximum Coverage Problem
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
Reuven Cohen, Liran Katzir
CEC
2009
IEEE
14 years 3 months ago
Inertial geometric particle swarm optimization
— Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of a simplified form of traditional particle swarm optimization (PSO) without the i...
Alberto Moraglio, Julian Togelius
ICTAI
2009
IEEE
14 years 3 months ago
Translation of an Argumentation Framework into a CP-Boolean Game
Abstract—There already exist some links between argumentation and game theory. For instance, dynamic games can be used for simulating interactions between agents in an argumentat...
Elise Bonzon, Caroline Devred, Marie-Christine Lag...