2877 search results - page 423 / 576 » The Complexity of Planarity Testing |
159
click to vote
AIRS
2006
Springer
15 years 7 months ago
2006
Springer
Recently, much research has been proposed using nature inspired algorithms to perform complex machine learning tasks. Ant Colony Optimization (ACO) is one such algorithm based on s...
124
click to vote
ASAP
2004
IEEE
15 years 7 months ago
2004
IEEE
The Compaan compiler automatically derives a Process Network (PN) description from an application written in Matlab. The basic element of a PN is a Producer/Consumer (P/C) pair. F...
130
click to vote
FPGA
2004
ACM
15 years 7 months ago
2004
ACM
This paper presents a new approach to timing optimization for FPGA designs, namely incremental physical resynthesis, to answer the challenge of effectively integrating logic and p...
165
click to vote
FQAS
2004
Springer
15 years 7 months ago
2004
Springer
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
154
click to vote
EWCBR
2006
Springer
15 years 7 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...