1998 search results - page 318 / 400 » Complexity of the Cover Polynomial |
166
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
145
click to vote
SIGECOM
2009
ACM
16 years 29 days ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
214
click to vote
SMA
2009
ACM
16 years 29 days ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
160
click to vote
CDC
2008
IEEE
16 years 28 days ago
2008
IEEE
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
138
click to vote
GLOBECOM
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract—In modern DSL networks, crosstalk among different lines (i.e., users) is the major source of performance degradation. Dynamic Spectrum Management (DSM) refers to a set o...