1686 search results - page 179 / 338 » Programs as polygraphs: computability and complexity |
130
click to vote
COLT
2004
Springer
15 years 7 months ago
2004
Springer
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
120
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...
248
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
239
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
145
click to vote
CF
2004
ACM
15 years 9 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...