1884 search results - page 287 / 377 » Simple Algorithm for Simple Timed Games |
144
click to vote
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
140
click to vote
SODA
1997
ACM
15 years 3 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
139
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
120
click to vote
GMP
2006
IEEE
15 years 8 months ago
2006
IEEE
For molding and casting processes, geometries that have undercut-free parting directions (UFPDs) are preferred for manufacturing. Identifying all UFPDs for arbitrary geometries at ...
105
click to vote
JCB
2006
15 years 2 months ago
2006
A stochastic genetic toggle switch model that consists of two identical, mutually repressive genes is built using the Gillespie algorithm with time delays as an example of a simpl...