4843 search results - page 254 / 969 » The Shortcut Problem - Complexity and Approximation |
126
Voted
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
137
Voted
AGP
1995
IEEE
15 years 7 months ago
1995
IEEE
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
147
Voted
COLOGNETWENTE
2007
15 years 5 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
134
Voted
UAI
2001
15 years 5 months ago
2001
We propose a new approach to value-directed belief state approximationfor POMDPs. The valuedirected model allows one to choose approximation methods for belief state monitoringtha...
120
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...