3145 search results - page 110 / 629 » Algebraic Linear Orderings |
149
Voted
AIPS
2010
15 years 4 months ago
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
137
click to vote
AIPS
2008
15 years 6 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
150
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
123
Voted
RELMICS
2009
Springer
15 years 10 months ago
2009
Springer
Using relation algebra, we generalize Aumann’s notion of a contact relation and that of a closure operation from powersets to general membership relations and their induced parti...
124
click to vote
TIT
2010
14 years 11 months ago
2010
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacityachieving code ensembles with different algebraic structure. It is proved t...