6110 search results - page 354 / 1222 » Approximate Computing |
225
click to vote
PCI
2001
Springer
15 years 11 months ago
2001
Springer
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
154
click to vote
COR
2006
15 years 6 months ago
2006
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
165
click to vote
IJCAI
2003
15 years 8 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
226
click to vote
IEEEICCI
2006
IEEE
16 years 23 days ago
2006
IEEE
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on universe. In the view of granular computing, classical ro...
146
click to vote
ICONIP
2004
15 years 8 months ago
2004
Abstract. Mutual Information (MI) is a long studied measure of coding efficiency, and many attempts to apply it to population coding have been made. However, this is a computationa...