Sciweavers

1357 search results - page 125 / 272
» Compositionality in Graph Transformation
Sort
View
127
Voted
CPAIOR
2006
Springer
15 years 7 months ago
Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling
Abstract. This paper considers all the variants of the traveling tournament prob) proposed in [17, 7] to abstract the salient features of major league baseball (MLB) in the United ...
Pascal Van Hentenryck, Yannis Vergados
81
Voted
IJSTM
2008
59views more  IJSTM 2008»
15 years 3 months ago
Knowledge-Intensive Business Services (KIBS) as drivers of multilevel knowledge dynamics
: KIBS research to date has been conducted mainly by taking an innovation perspective where an explicit focus on knowledge processes is not very well pronounced. The paper intends ...
Simone Strambach
140
Voted
IJWET
2008
75views more  IJWET 2008»
15 years 2 months ago
Semantic model-driven development of web service architectures
: Building service-based architectures has become a major area of interest since the advent of web services. Modelling these architectures is a central activity. Model-driven devel...
Claus Pahl
208
Voted
IWPEC
2010
Springer
15 years 1 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
115
Voted
MFCS
2007
Springer
15 years 9 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda