Sciweavers

19700 search results - page 118 / 3940
» DNA-Based Computation Times
Sort
View
CCE
2011
14 years 8 months ago
Time representations and mathematical models for process scheduling problems
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
Sylvain Mouret, Ignacio E. Grossmann, Pierre Pesti...
COMPGEOM
2011
ACM
14 years 8 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
ML
2002
ACM
121views Machine Learning» more  ML 2002»
15 years 4 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
15 years 2 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
CDC
2010
IEEE
152views Control Systems» more  CDC 2010»
15 years 5 days ago
Asymptotic achievability for linear time invariant state space systems
Abstract-- We consider here the problem of finding a controller such that when interconnected to the plant, we obtain a system which is asymptotically equivalent to a desired syste...
Harsh Vinjamoor, Arjan van der Schaft