Sciweavers

10666 search results - page 1596 / 2134
» Quantum programming languages
Sort
View
CAISE
2007
Springer
16 years 1 months ago
Rule-based Autocompletion of Business Process Models
Several methods based upon textual programming languages or graphical notations have been proposed for manual modeling of business process models. But since manual process modeling...
Thomas Hornung, Agnes Koschmider, Andreas Oberweis
ICALP
2007
Springer
16 years 1 months ago
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
Michael R. Fellows, Guillaume Fertin, Danny Hermel...
ICALP
2007
Springer
16 years 1 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
ICALP
2007
Springer
16 years 1 months ago
Strong Price of Anarchy for Machine Load Balancing
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olon...
ICALP
2007
Springer
16 years 1 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk
« Prev « First page 1596 / 2134 Last » Next »