914 search results - page 5 / 183 » On the evaluation of the decision performance of an incomple... |
CODES
2004
IEEE
13 years 11 months ago
2004
IEEE
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
ATAL
2005
Springer
14 years 28 days ago
2005
Springer
In many negotiation and bargaining scenarios, a particular agent may need to interact repeatedly with another agent. Typically, these interactions take place under incomplete info...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
ICVS
2009
Springer
14 years 1 months ago
2009
Springer
Traditionally computer vision and pattern recognition algorithms are evaluated by measuring differences between final interpretations and ground truth. These black-box evaluations ...
ARCS
2004
Springer
14 years 24 days ago
2004
Springer
Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cyc...