Sciweavers

4679 search results - page 21 / 936
» Modeling When Connections Are the Problem
Sort
View
COMMA
2008
14 years 11 months ago
Focused search for Arguments from Propositional Knowledge
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
Vasiliki Efstathiou, Anthony Hunter
ICC
2008
IEEE
137views Communications» more  ICC 2008»
15 years 4 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
14 years 9 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
GLOBECOM
2006
IEEE
15 years 3 months ago
Connection Preemption in Multi-Class Networks
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
Fahad Rafique Dogar, Laeeq Aslam, Zartash Afzal Uz...
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
14 years 7 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...