1458 search results - page 216 / 292 » Monads for incremental computing |
133
click to vote
DAC
2006
ACM
15 years 7 months ago
2006
ACM
Conventionally, signal net routing is almost always implemented as Steiner trees. However, non-tree topology is often superior on timing performance as well as tolerance to open f...
142
click to vote
ECAI
2006
Springer
15 years 7 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 ...
145
click to vote
FROCOS
2000
Springer
15 years 7 months ago
2000
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
153
click to vote
HIPC
2000
Springer
15 years 7 months ago
2000
Springer
Embedded systems consisting of the application program ROM, RAM, the embedded processor core and any custom hardware on a single wafer are becoming increasingly common in areas suc...
138
click to vote
CP
1995
Springer
15 years 7 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...