1258 search results - page 182 / 252 » Architecture-driven Problem Decomposition |
113
Voted
DEXAW
1998
IEEE
15 years 6 months ago
1998
IEEE
Huge size and high complexity of legacy software are the main sources of today's software evolution problems. While we can ease software evolution with re-engineering tools, ...
131
click to vote
FCT
2009
Springer
15 years 5 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
114
click to vote
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
193
click to vote
WAE
2001
15 years 3 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
107
click to vote
AIPS
2000
15 years 3 months ago
2000
In the last years, some very promising domain independent heuristic state-space planners for STRIPS worlds, like ASP/HSP, HSPr and GRT, have been presented. These planners achieve...