Sciweavers

1520 search results - page 181 / 304
» Class Hierarchy Specialization
Sort
View
FMSB
2008
130views Formal Methods» more  FMSB 2008»
13 years 9 months ago
Approximating Continuous Systems by Timed Automata
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...
Oded Maler, Grégory Batt
FOSSACS
2008
Springer
13 years 9 months ago
What Else Is Decidable about Integer Arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Peter Habermehl, Radu Iosif, Tomás Vojnar
CCCG
2008
13 years 9 months ago
Draining a Polygon - or - Rolling a Ball out of a Polygon
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
DAGSTUHL
2007
13 years 9 months ago
Exact Elimination of Cycles in Graphs
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
Daniel Raible, Henning Fernau
ISTA
2007
13 years 9 months ago
Resolving Indifferences in Multiple Attribute Business Information System Selection with Social Choice Methods
: The evaluation of Information Systems (IS) is a critical process for the successful development of any organizational IT capability. An important class of decision making techniq...
Edward Bernroider, Johann Mitlöhner