2168 search results - page 324 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
121
click to vote
WISE
2002
Springer
15 years 8 months ago
2002
Springer
With the flurry of research on P2P computing, many P2P technical challenges have emerged, one of which is how to efficiently locate desired resources. Advances have been made in...
131
Voted
ICCAD
2004
IEEE
16 years 26 days ago
2004
IEEE
While process variations are becoming more significant with each new IC technology generation, they are often modeled via linear regression models so that the resulting performanc...
137
Voted
NIPS
2008
15 years 5 months ago
2008
In kernel-based regression learning, optimizing each kernel individually is useful when the data density, curvature of regression surfaces (or decision boundaries) or magnitude of...
160
click to vote
JAIR
2008
15 years 4 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
123
click to vote
APCSAC
2003
IEEE
15 years 7 months ago
2003
IEEE
Very Long Instruction Word (VLIW) architectures exploit instruction level parallelism (ILP) with the help of the compiler to achieve higher instruction throughput with minimal hard...