Sciweavers

10271 search results - page 1700 / 2055
» Self-plagiarism in computer science
Sort
View
WSC
1998
15 years 8 months ago
A Library of Reusable Model Components for Visual Simulation of the NCSTRL System
This paper presents a library of reusable model components for visual simulation of the Networked Computer Science Technical Report Library (NCSTRL) and illustrates how a visual s...
Osman Balci, Cengiz Ulusaraç, Poorav Shah, ...
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
15 years 8 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm
ACTA
2007
106views more  ACTA 2007»
15 years 7 months ago
Symbolic models for control systems
In this paper we provide a bridge between the infinite state models used in control theory to describe the evolution of continuous physical processes and the finite state models ...
Paulo Tabuada
APAL
2007
104views more  APAL 2007»
15 years 7 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi
ENTCS
2008
98views more  ENTCS 2008»
15 years 6 months ago
Modal Expressiveness of Graph Properties
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
Mario R. F. Benevides, L. Menasché Schechte...
« Prev « First page 1700 / 2055 Last » Next »