Sciweavers

3958 search results - page 636 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
123
Voted
ECUMN
2007
Springer
15 years 8 months ago
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
Julien Gossa, Jean-Marc Pierson
AICT
2006
IEEE
15 years 8 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
BROADNETS
2006
IEEE
15 years 8 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
PPSWR
2005
Springer
15 years 8 months ago
A Geospatial World Model for the Semantic Web
The Semantic Web is an endeavour aiming at enhancing Web data with meta-data and data processing, as well as processing methods specifying the “meaning” of such data and allowi...
François Bry, Bernhard Lorenz, Hans Jü...
ICICS
2005
Springer
15 years 8 months ago
Network Vulnerability Analysis Through Vulnerability Take-Grant Model (VTG)
Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a f...
Hamid Reza Shahriari, Reza Sadoddin, Rasool Jalili...