Sciweavers

3359 search results - page 23 / 672
» A Simplified Idea Algorithm
Sort
View
IDEAS
2003
IEEE
112views Database» more  IDEAS 2003»
14 years 28 days ago
Persistent Applications via Automatic Recovery
Building highly available enterprise applications using web-oriented middleware is hard. Runtime implementations frequently do not address the problems of application state persis...
Roger S. Barga, David B. Lomet, Stelios Paparizos,...
SCAI
2001
13 years 9 months ago
Using Situated Communication in Distributed Autonomous Mobile Robotics
When using communication in multi-robot systems it's often not desirable to choose an form of communication that separates the messages from the physical environment in which...
Kasper Støy
DAC
2004
ACM
14 years 8 months ago
Abstraction of assembler programs for symbolic worst case execution time analysis
ion of Assembler Programs for Symbolic Worst Case Execution Time Analysis Tobias Schuele Tobias.Schuele@informatik.uni-kl.de Klaus Schneider Klaus.Schneider@informatik.uni-kl.de Re...
Klaus Schneider, Tobias Schüle
BCBGC
2008
13 years 9 months ago
BMA - Boolean Matrices as Model for Motif Kernels
We introduce the data model BM, which specifies kernels of motifs by means of Boolean matrices. Different from position frequency matrices these only specify which bases can appea...
Jan Schröder, Manfred Schimmler, Heiko Schr&o...
TRIER
2002
13 years 7 months ago
Precise Interprocedural Dependence Analysis of Parallel Programs
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
Markus Müller-Olm