4355 search results - page 113 / 871 » From Interpretation to Compilation |
141
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
136
Voted
POPL
2000
ACM
15 years 8 months ago
2000
ACM
Adopting a programming-language perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authent...
134
click to vote
CAEPIA
2005
Springer
15 years 9 months ago
2005
Springer
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
149
click to vote
AIPS
2006
15 years 5 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
141
click to vote
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...