5506 search results - page 389 / 1102 » Minimal Logic Programs |
135
click to vote
ICCD
2005
IEEE
16 years 3 months ago
2005
IEEE
Traditional approaches for sequential logic optimization include (1) explicit state-based techniques such as state minimization, (2) structural techniques such as retiming, and (3...
161
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
169
click to vote
GREC
2005
Springer
16 years 8 days ago
2005
Springer
This paper presents a solution for online composite sketchy shape recognition. The kernel of the strategy treats both stroke segmentation and sketch recognition as an optimization ...
170
Voted
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We discuss the problem of model selection in Genetic Programming using the framework provided by Statistical Learning Theory, i.e. Vapnik-Chervonenkis theory (VC). We pre...
187
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. Nested data-parallel programs often have large memory requirements due to their high degree of parallelism. Piecewise execution is an implementation technique used to min...