1806 search results - page 103 / 362 » Some Functions Computable with a Fused-Mac |
150
click to vote
NIPS
2001
15 years 7 months ago
2001
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
176
click to vote
SPIESR
1997
15 years 7 months ago
1997
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
196
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
150
click to vote
DM
2010
15 years 6 months ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
156
click to vote
COR
2006
15 years 6 months ago
2006
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....