2766 search results - page 374 / 554 » Algorithms for trigonometric polynomials |
153
click to vote
JSCIC
2008
15 years 4 months ago
2008
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...
JGT
2006
15 years 4 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
169
click to vote
ML
2008
ACM
15 years 4 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
146
click to vote
JSAT
2006
15 years 4 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
126
click to vote
MST
2008
15 years 4 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...