Sciweavers

68 search results - page 8 / 14
» Decision procedures for term algebras with integer constrain...
Sort
View
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
13 years 4 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang
CPAIOR
2005
Springer
14 years 7 days ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
CP
2008
Springer
13 years 8 months ago
Cost-Based Domain Filtering for Stochastic Constraint Programming
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...
CADE
2001
Springer
13 years 11 months ago
Approximating Dependency Graphs Using Tree Automata Techniques
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
Aart Middeldorp
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 6 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram