Sciweavers

2517 search results - page 206 / 504
» Specifying Weak Sets
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 6 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
ESAW
2009
Springer
16 years 1 months ago
Normative Multi-Agent Organizations
Multi-agent systems are viewed as consisting of individual agents whose behaviors are regulated by organization artifacts. This abstract presents a programming language, which is d...
Mehdi Dastani
SRDS
2006
IEEE
16 years 18 days ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring
ICSM
2005
IEEE
16 years 5 days ago
Using Pointcut Delta Analysis to Support Evolution of Aspect-Oriented Software
Aspect oriented programming has been proposed as a way to improve modularity of software systems by allowing encapsulation of cross-cutting concerns. To do so, aspects specify whe...
Maximilian Störzer, Jürgen Graf
ICSE
2003
IEEE-ACM
15 years 11 months ago
A Tutorial on Feature Oriented Programming and Product-Lines
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
Don S. Batory