17760 search results - page 3212 / 3552 » A Generalization of the Massey-Ding Algorithm |
178
click to vote
EMSOFT
2007
Springer
16 years 28 days ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
187
click to vote
ESA
2007
Springer
16 years 28 days ago
2007
Springer
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
176
click to vote
ESA
2007
Springer
16 years 28 days ago
2007
Springer
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
170
click to vote
EUROCAST
2007
Springer
16 years 28 days ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
161
click to vote
FPGA
2007
ACM
16 years 28 days ago
2007
ACM
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...