6110 search results - page 920 / 1222 » Approximate Computing |
183
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
161
click to vote
DIS
2008
Springer
15 years 7 months ago
2008
Springer
We consider learning tasks where multiple target variables need to be predicted. Two approaches have been used in this setting: (a) build a separate single-target model for each ta...
188
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 6 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
175
click to vote
APSCC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
182
click to vote
CVPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Human faces are neither exactly Lambertian nor entirely convex and hence most models in literature which make the Lambertian assumption, fall short when dealing with specularities...