Sciweavers

3820 search results - page 710 / 764
» Bounded Model Debugging
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 3 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ASM
2004
ASM
14 years 3 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 3 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
EMSOFT
2004
Springer
14 years 3 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
JIT
2004
Springer
204views Database» more  JIT 2004»
14 years 3 months ago
Ercatons: Thing-Oriented Programming
Thing-oriented programming (TP) is an emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-orient...
Oliver Imbusch, Falk Langhammer, Guido von Walter