4426 search results - page 443 / 886 » Concurrent Constraint Programming |
242
click to vote
CIE
2010
Springer
16 years 12 days ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
181
click to vote
SAS
1999
Springer
15 years 12 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...
211
Voted
AIPS
2011
14 years 11 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...
211
click to vote
CP
2003
Springer
16 years 24 days 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 ...
206
click to vote
CF
2004
ACM
16 years 1 months ago
2004
ACM
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...