1205 search results - page 183 / 241 » On P Systems with Bounded Parallelism |
133
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
147
click to vote
LOPSTR
2004
Springer
15 years 9 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
150
Voted
ISORC
2005
IEEE
15 years 9 months ago
2005
IEEE
One of the problems with Java for real-time systems is the unpredictable behavior of garbage collection (GC). GC introduces unexpected load and causes undesirable delays for real-...
148
Voted
FIDJI
2003
Springer
15 years 9 months ago
2003
Springer
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...
140
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...