1941 search results - page 31 / 389 » On the Hardness of Approximate Reasoning |
102
click to vote
RSEISP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Approximate reasoning is used in a variety of reasoning tasks in Logicbased Artificial Intelligence. In this abstract we compare a number of such reasoning schemes and s...
106
click to vote
IANDC
2007
14 years 11 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
Energy-efficiency and power-awareness for electronic systems have been important design issues in hardware and software implementations. We consider the scheduling of periodic ha...
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...