Sciweavers

801 search results - page 77 / 161
» Minimal Locked Trees
Sort
View
INFOCOM
1992
IEEE
15 years 10 months ago
Topological Design of Interconnected LAN-MAN Networks
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
Cem Ersoy, Shivendra S. Panwar
RIAO
2007
15 years 7 months ago
An Information Retrieval Driven by Ontology: from Query to Document Expansion
The paper proposes an approach to information retrieval based on the use of a structure (ontology) both for document (resp. query) indexing and query evaluating. The conceptual st...
Mustapha Baziz, Mohand Boughanem, Gabriella Pasi, ...
IPCO
2010
153views Optimization» more  IPCO 2010»
15 years 4 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
LCN
2006
IEEE
16 years 10 days ago
Computing Real Time Jobs in P2P Networks
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 6 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan