Sciweavers

591 search results - page 60 / 119
» A constraint programming approach to cutset problems
Sort
View
CP
2009
Springer
15 years 4 months ago
Closing the Open Shop: Contradicting Conventional Wisdom
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert
JPDC
2010
133views more  JPDC 2010»
14 years 4 months ago
Lock-free parallel dynamic programming
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
Alex Stivala, Peter J. Stuckey, Maria Garcia de la...
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
14 years 11 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner
ACTA
2010
191views more  ACTA 2010»
14 years 10 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
EOR
2002
66views more  EOR 2002»
14 years 9 months ago
Dynamic multi-objective heating optimization
We develop a multicriteria approach to the problem of space heating under a time varying price of electricity. In our dynamic goal programming model the goals are ideal temperatur...
Raimo P. Hämäläinen, Juha Mänt...