Sciweavers

183 search results - page 29 / 37
» On the Matching Problem for Special Graph Classes
Sort
View
MANSCI
2008
119views more  MANSCI 2008»
15 years 5 months ago
Service-Level Differentiation in Call Centers with Fully Flexible Servers
We study large-scale service systems with multiple customer classes and many statistically identical servers. The following question is addressed: How many servers are required (s...
Itay Gurvich, Mor Armony, Avishai Mandelbaum
LFCS
2007
Springer
15 years 11 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
132
Voted
CVPR
2008
IEEE
16 years 7 months ago
Exact inference in multi-label CRFs with higher order cliques
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
Srikumar Ramalingam, Pushmeet Kohli, Karteek Alaha...
GG
2008
Springer
15 years 6 months ago
Model-Driven Development of Model Transformations
The model-driven development of model transformations requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, t...
Pieter Van Gorp
SPAA
2003
ACM
15 years 10 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman