Sciweavers

4679 search results - page 4 / 936
» Modeling When Connections Are the Problem
Sort
View
SAINT
2008
IEEE
14 years 11 days ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
MINENET
2006
ACM
13 years 12 months ago
Diagnosis of TCP overlay connection failures using bayesian networks
When failures occur in Internet overlay connections today, it is difficult for users to determine the root cause of failure. An overlay connection may require TCP connections bet...
George J. Lee, Lindsey Poole
FOIKS
2008
Springer
13 years 7 months ago
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
Vasiliki Efstathiou, Anthony Hunter
ICPP
1993
IEEE
13 years 10 months ago
Solving the Region Growing Problem on the Connection Machine
Abstract { This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the ...
Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi V. S...
CAV
2003
Springer
160views Hardware» more  CAV 2003»
13 years 11 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek