6045 search results - page 207 / 1209 » Computable Linearizations of Well-partial-orderings |
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
(t, m, s)-nets were defined by Niederreiter [6], based on earlier work by Sobol' [7], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in comb...
ICTAI
2003
IEEE
14 years 1 months ago
2003
IEEE
Planning for numeric goals is an important problem. Only one of the many participants from the 2002 international planning competition (Metric-FF) can effectively handle problems ...
ICTAC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
AAAI
2011
12 years 8 months ago
2011
The standard approach to computing an optimal mixed strategy to commit to is based on solving a set of linear programs, one for each of the follower’s pure strategies. We show t...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...