11740 search results - page 430 / 2348 » More Problems in Rewriting |
171
click to vote
SSR
1997
15 years 8 months ago
1997
Configuration management of compiled software artifacts (programs, libraries, icons, etc.) is a growing problem as software reuse becomes more prevalent. For an application compos...
172
click to vote
WSC
2000
15 years 8 months ago
2000
Simulation professionals need to see themselves first as systems analysts, i.e., problem solvers, rather than just simulation users. As the networked digital economy develops, sys...
168
click to vote
ECAI
2010
Springer
15 years 8 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
192
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Controlling concurrent systems to impose some global invariant is an undecidable problem. One can gain decidability at the expense of reducing concurrency. Even under thi...
154
Voted
AAMAS
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...