Sciweavers

4095 search results - page 359 / 819
» How to test a tree
Sort
View
ATAL
2009
Springer
15 years 10 months ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon
IWDC
2001
Springer
146views Communications» more  IWDC 2001»
15 years 10 months ago
Aggregated Multicast for Scalable QoS Multicast Provisioning
Abstract. IP multicast suffers from scalability problem with the number of concurrently active multicast groups, while scalability of QoS multicast is even further from being solve...
Mario Gerla, Aiguo Fei, Jun-Hong Cui, Michalis Fal...
DGCI
2006
Springer
15 years 9 months ago
Revisiting Digital Straight Segment Recognition
Abstract. This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognitio...
François de Vieilleville, Jacques-Olivier L...
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 9 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
AOSD
2008
ACM
15 years 7 months ago
Tool-supported refactoring of aspect-oriented programs
Aspect-oriented programming languages provide new composition mechanisms for improving the modularity of crosscutting concerns. Implementations of such language support use advanc...
Jan Wloka, Robert Hirschfeld, Joachim Hänsel