1941 search results - page 150 / 389 » On the Hardness of Approximate Reasoning |
174
click to vote
AHS
2007
IEEE
16 years 23 days ago
2007
IEEE
System-on-Chip devices containing both conventional and reconfigurable circuits are increasing in popularity. However the on-chip debug support infrastructure required to aid syst...
156
click to vote
GD
2007
Springer
16 years 20 days ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
165
click to vote
MFCS
2007
Springer
16 years 19 days ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
173
click to vote
ISCAS
2005
IEEE
16 years 2 days ago
2005
IEEE
Although many researches have investigated transparent scrambling video techniques, an issue of which transcoding relates to downsizing scrambled video without unscrambling has ha...
181
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
This paper introduces a gradient-based reward prediction update mechanism to the XCS classifier system as applied in neuralnetwork type learning and function approximation mechani...