Sciweavers

1776 search results - page 195 / 356
» Uncertain Linear Constraints
Sort
View
BPM
2009
Springer
153views Business» more  BPM 2009»
15 years 7 months ago
DECLARE Demo: A Constraint-based Workflow Management System
Abstract. Mainstream workflow management systems are using procedural languages ranging from BPMN and EPCs to BPEL and YAWL. By demonstrating DECLARE, we will show that it is also ...
Maja Pesic, Helen Schonenberg, Wil M. P. van der A...
DISOPT
2008
113views more  DISOPT 2008»
15 years 6 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
JISE
2006
76views more  JISE 2006»
15 years 6 months ago
Process and Planning Support for Iterative Porting
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
Pradeep Varma
148
Voted
COLING
2002
15 years 6 months ago
A Quantitative Model of Word Order and Movement in English, Dutch and German Complement Constructions
We present a quantitative model of word order and movement constraints that enables a simple and uniform treatment of a seemingly heterogeneous collection of linear order phenomena...
Karin Harbusch, Gerard Kempen
HEURISTICS
2002
155views more  HEURISTICS 2002»
15 years 5 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz