2583 search results - page 336 / 517 » On the Representation of Timed Polyhedra |
174
click to vote
NIPS
1993
15 years 7 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
180
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Simulating the major molecular events inside an Escherichia coli cell can lead to a very large number of reactions that compose its overall behaviour. Not only should ...
190
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
313
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
200
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...