2239 search results - page 266 / 448 » Computing with abstract matrix structures |
104
click to vote
MLG
2007
Springer
15 years 9 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
164
click to vote
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
140
click to vote
LISP
2008
15 years 3 months ago
2008
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
121
click to vote
VLSID
2004
IEEE
16 years 3 months ago
2004
IEEE
Recent research for testable designs has focussed on inserting test structures by re-arranging an Register-TransferLevel (RTL) data path generated from a behavioural description t...
125
click to vote
CSEE
2009
Springer
15 years 10 months ago
2009
Springer
This paper reports on results from a pilot study that used Bloom’s Taxonomy to observe cognition levels during software inspections conducted by undergraduate computer science a...