Sciweavers

1093 search results - page 199 / 219
» Clustering from Constraint Graphs
Sort
View
COMCOM
2006
100views more  COMCOM 2006»
13 years 10 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 10 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
JWSR
2007
106views more  JWSR 2007»
13 years 9 months ago
Architecture-Driven Service Discovery for Service Centric Systems
: Service discovery has been recognised as an important aspect in the development of service centric systems, i.e., software systems which deploy web services. To develop such syst...
Alexander Kozlenkov, George Spanoudakis, Andrea Zi...
MP
2010
99views more  MP 2010»
13 years 8 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 months ago
The Dichotomy of List Homomorphisms for Digraphs
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
Pavol Hell, Arash Rafiey