Sciweavers

98 search results - page 3 / 20
» The ROOTS Constraint
Sort
View
ISOLA
2007
Springer
13 years 12 months ago
Proved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B Method
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
Joris Rehm, Dominique Cansell
PPSN
2010
Springer
13 years 4 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
COR
2008
142views more  COR 2008»
13 years 5 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
13 years 12 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
ACSAC
2001
IEEE
13 years 9 months ago
Restricting Access with Certificate Attributes in Multiple Root Environments-A Recipe for Certificate Masquerading
The issue of certificate masquerading against the SSL protocol is pointed out in [4]. In [4], various forms of server certificate masquerading are identified. It should also be no...
James M. Hayes