Sciweavers

1205 search results - page 183 / 241
» On P Systems with Bounded Parallelism
Sort
View
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
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 ...
Philip Bille, Anna Pagh, Rasmus Pagh
LOPSTR
2004
Springer
14 years 1 months ago
Determinacy Analysis for Logic Programs Using Mode and Type Information
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 (...
Pedro López-García, Francisco Bueno,...
ISORC
2005
IEEE
14 years 1 months ago
Object-Reuse for More Predictable Real-Time Java Behavior
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-...
Jameela Al-Jaroodi, Nader Mohamed
FIDJI
2003
Springer
14 years 26 days ago
Model Generation for Distributed Java Programs
— 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...
Rabéa Boulifa, Eric Madelaine
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
11 years 10 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
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...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...