Sciweavers

GCSE
2001
Springer
14 years 12 days ago
Components, Interfaces and Information Models within a Platform Architecture
In this paper we describe our experiences with the development of a platform in the medical imaging domain. Three important ingredients of this platform are components, interfaces...
Jan Gerben Wijnstra
GCSE
2001
Springer
14 years 12 days ago
Generating Application Development Environments for Java Frameworks
Markku Hakala, Juha Hautamäki, Kai Koskimies,...
GCSE
2001
Springer
14 years 12 days ago
Base Class Injection
Abstract. Class hierarchies, though theoretically reusable, have generally not seen much practical reuse in applications, due in part to the inflexibility of the inheritance relat...
Douglas Gregor, Sibylle Schupp, David R. Musser
GCSE
2001
Springer
14 years 12 days ago
Scenario-Based Generation and Evaluation of Software Architectures
Architecture conception is a difficult and time consuming process, requiring advanced skills from the software architect. The tasks of an architect are alleviated if means can be p...
Hans de Bruijn, Johannes C. van Vliet
GCSE
2001
Springer
14 years 12 days ago
Reflection Support by Means of Template Metaprogramming
Abstract. The C++ language has only a limited runtime type information system, which doesn’t provide full reflection capabilities. We present a general mechanism to support refle...
Giuseppe Attardi, Antonio Cisternino
FSTTCS
2001
Springer
14 years 12 days ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
FSTTCS
2001
Springer
14 years 12 days ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
FSTTCS
2001
Springer
14 years 12 days ago
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
Erion Plaku, Igor Shparlinski
FSTTCS
2001
Springer
14 years 12 days ago
Properties of Distributed Timed-Arc Petri Nets
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...
Mogens Nielsen, Vladimiro Sassone, Jirí Srb...