741 search results - page 23 / 149 » Problem Programmers |
124
click to vote
EUROSYS
2006
ACM
15 years 11 months ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
127
click to vote
PC
2010
15 years 12 days ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
100
click to vote
DAGSTUHL
2004
15 years 3 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
130
click to vote
JC
2006
15 years 1 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
122
click to vote
JC
2007
15 years 1 months ago
2007
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...