5090 search results - page 222 / 1018 » Constructing Strategies for Programming |
135
click to vote
WSC
2008
15 years 6 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
133
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probab...
132
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
153
click to vote
CP
2010
Springer
15 years 2 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
156
click to vote
OOPSLA
2005
Springer
15 years 10 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...