Sciweavers

4865 search results - page 159 / 973
» The Complexity of Graph Connectivity
Sort
View
167
Voted
GLOBECOM
2010
IEEE
15 years 23 days ago
Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
Dexiang Wang, Janise McNair
CPAIOR
2007
Springer
15 years 9 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
116
Voted
ICPP
1994
IEEE
15 years 7 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
122
Voted
WETICE
1999
IEEE
15 years 7 months ago
Replacing Copies with Connections: Managing Software across the Virtual Organization
The Internet, the World Wide Web, JavaTM technology, and software components are changing the software business. Activities traditionally constrained by the need for intense infor...
Tobias Murer, Michael L. Van de Vanter
JELIA
2010
Springer
15 years 1 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...