Sciweavers

2398 search results - page 47 / 480
» Constraint Programming and Graph Algorithms
Sort
View
SCHEDULING
2008
85views more  SCHEDULING 2008»
13 years 10 months ago
A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs
This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that dep...
Moustafa Elshafei, Hesham K. Alfares
KR
2010
Springer
14 years 3 months ago
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
Reinhard Pichler, Stefan Rümmele, Stefan Szei...
PPOPP
2012
ACM
12 years 6 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
GD
2008
Springer
13 years 12 months ago
Topology Preserving Constrained Graph Layout
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
Tim Dwyer, Kim Marriott, Michael Wybrow
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
14 years 3 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig