Sciweavers

592 search results - page 59 / 119
» Using Constraint Programming to Solve the Maximum Clique Pro...
Sort
View
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
13 years 10 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
RECOMB
1997
Springer
15 years 7 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
SCHEDULING
2008
85views more  SCHEDULING 2008»
15 years 2 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
CP
2005
Springer
15 years 8 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
IV
2003
IEEE
98views Visualization» more  IV 2003»
15 years 8 months ago
A new approach to virtual design for spatial configuration problems
In this paper, we present a new framework for the use of Virtual Reality (VR) in engineering design for configuration applications. Traditional VR systems support the visual explo...
Carlos Calderon, Marc Cavazza, Daniel Diaz