Sciweavers

10707 search results - page 1891 / 2142
» Designing executable abstractions
Sort
View
AMAST
2006
Springer
15 years 11 months ago
State Space Representation for Verification of Open Systems
Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...
Irem Aktug, Dilian Gurov
ANTSW
2006
Springer
15 years 11 months ago
An Analysis of the Different Components of the AntHocNet Routing Algorithm
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
AOSE
2006
Springer
15 years 11 months ago
Applying the Governance Framework Technique to Promote Maintainability in Open Multi-Agent Systems
Abstract. Governance means that specifications are enforced dynamically at application runtime. Governance framework is a technique to design and implement an extensible interactio...
Gustavo R. de Carvalho, Carlos José Pereira...
CAISE
2004
Springer
15 years 11 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 11 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
« Prev « First page 1891 / 2142 Last » Next »