Sciweavers

151 search results - page 11 / 31
» A new survivable mapping problem in IP-over-WDM networks
Sort
View
SPDP
1991
IEEE
13 years 11 months ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth
LION
2009
Springer
112views Optimization» more  LION 2009»
14 years 2 months ago
A Graph-Based Semi-supervised Algorithm for Protein Function Prediction from Interaction Maps
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
Valerio Freschi
BIS
2010
185views Business» more  BIS 2010»
13 years 5 months ago
From Economic Drivers to B2B Process Models: A Mapping from REA to UMM
Inter-organizational B2B systems are most likely tending to change their business requirements over time - e.g. establishing new partnerships or change existing ones. The problem i...
Rainer Schuster, Thomas Motal, Christian Huemer, H...
TON
2010
122views more  TON 2010»
13 years 6 months ago
The (in)completeness of the observed internet AS-level structure
— Despite significant efforts to obtain an accurate picture of the Internet’s connectivity structure at the level of individual autonomous systems (ASes), much has remained un...
Ricardo V. Oliveira, Dan Pei, Walter Willinger, Be...
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
14 years 1 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...