3874 search results - page 644 / 775 » Approximation Algorithms for k-hurdle Problems |
162
click to vote
IAT
2008
IEEE
16 years 23 days ago
2008
IEEE
The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has ...
156
click to vote
IPSN
2007
Springer
16 years 14 days ago
2007
Springer
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
175
click to vote
MIRAGE
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
182
click to vote
IPPS
2006
IEEE
16 years 10 days ago
2006
IEEE
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...
165
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...