1279 search results - page 155 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
127
click to vote
NIPS
2007
15 years 3 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
147
click to vote
CCR
2006
15 years 1 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
125
click to vote
KDD
2010
ACM
15 years 10 days ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
134
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
119
click to vote
WIDM
2006
ACM
15 years 7 months ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...