Sciweavers

516 search results - page 38 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
COCOA
2008
Springer
13 years 11 months ago
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
Gerold Jäger, Paul Molitor
TCS
2011
13 years 4 months ago
On the relationship between fuzzy and Boolean cellular automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
Heather Betel, Paola Flocchini
HYBRID
2000
Springer
14 years 1 months ago
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
Abstract. Sincehybridembeddedsystemsarepervasiveandoftensafetycritical, guarantees about their correct performance are desirable. The hybrid systemsmodelcheckerHyTech providessuch ...
Thomas A. Henzinger, Benjamin Horowitz, Rupak Maju...
COMPGEOM
2010
ACM
14 years 3 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
DGCI
2006
Springer
13 years 12 months ago
Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...
Sara Brunetti, Alain Daurat, Attila Kuba