Sciweavers

2834 search results - page 463 / 567
» Representing Trees with Constraints
Sort
View
BPM
2007
Springer
157views Business» more  BPM 2007»
15 years 6 months ago
Linking Domain Models and Process Models for Reference Model Configuration
Abstract. Reference process models capture common practices in a given domain and variations thereof. Such models are intended to be configured in a specific setting, leading to in...
Marcello La Rosa, Florian Gottschalk, Marlon Dumas...
COCOA
2007
Springer
15 years 6 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
105
Voted
ECUMN
2007
Springer
15 years 6 months ago
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
Julien Gossa, Jean-Marc Pierson
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 6 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
FSTTCS
2007
Springer
15 years 6 months ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...