923 search results - page 12 / 185 » On the Topology of Discrete Strategies |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
ER
2004
Springer
14 years 1 months ago
2004
Springer
When we derive multi-scale databases from a source spatial database, the geometries and topological relations, which are a kind of constraints defined explicitly or implicitly in ...
CCE
2008
13 years 6 months ago
2008
Simulated Moving Bed (SMB) processes are widely used in sugar, petrochemical, and pharmaceutical industries. However, systematic optimization of SMB, especially finding the optima...
RTAS
2008
IEEE
14 years 2 months ago
2008
IEEE
We build on PTIDES, a programming model for distributed embedded systems that uses discrete-event (DE) models as program specifications. PTIDES improves on distributed DE executi...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...