1806 search results - page 89 / 362 » Some Functions Computable with a Fused-Mac |
134
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...
166
click to vote
CIE
2007
Springer
16 years 3 days ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
155
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
181
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
144
click to vote
SUTC
2008
IEEE
16 years 9 days ago
2008
IEEE
As the robotic industry is growing boomingly, the functionalities and system's architecture of robots are more and more complex. The development of robotic application system...