Sciweavers

13306 search results - page 446 / 2662
» Theoretical Computer Science
Sort
View
TCS
2010
15 years 2 months ago
Weak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
SPIN
2012
Springer
13 years 10 months ago
SMTInterpol: An Interpolating SMT Solver
Abstract. Craig interpolation is an active research topic and has become a powerful technique in verification. We present SMTInterpol, an interpolating SMT solver for the quantiļ¬...
Jürgen Christ, Jochen Hoenicke, Alexander Nut...
CSE
2009
IEEE
15 years 11 months ago
Where Information Searches for You: The Visible Past Ubiquitous Knowledge Environment for Digital Humanities
— Visible Past proposes a new class of interdisciplinary learning, documenting, knowledge production, and discovery experiences that are anchored in space and time indicators. Th...
Sorin Adam Matei, Eric A. Wernert, Travis Faas
CSE
2009
IEEE
15 years 11 months ago
Efficient Broadcast on Area of Interest in Voronoi Overlays
This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-topeer ne...
Michele Albano, Ranieri Baraglia, Matteo Mordacchi...
MFCS
2004
Springer
16 years 28 days ago
Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of ā€œspecial aspectsā€ to the problems encountered. Hence, the study of paramet...
Rolf Niedermeier