7092 search results - page 564 / 1419 » Parallelizing constraint programs |
119
click to vote
SAS
1999
Springer
15 years 9 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
146
click to vote
AIPS
2011
14 years 8 months ago
2011
We address a scheduling problem in the context of military aircraft maintenance where the goal is to meet the aircraft requirements for a number of missions in the presence of bre...
149
Voted
CP
2003
Springer
15 years 10 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
118
click to vote
KBSE
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a divide-and-conquer method, called DiConic, for automatic addition of failsafe fault-tolerance to distributed programs, where a failsafe program guarantees to meet its...
149
click to vote
ECAL
2007
Springer
15 years 11 months ago
2007
Springer
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...