1433 search results - page 73 / 287 » On Covering Problems of Rado |
158
click to vote
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
Many systems that learn from examples express the learned concept as a disjunction. Those disjuncts that cover only a few examples are referred to as small disjuncts. The problem ...
154
click to vote
PERCOM
2009
ACM
16 years 1 months ago
2009
ACM
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
183
click to vote
IPCO
2007
15 years 7 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
173
click to vote
AIPS
2011
14 years 10 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
149
click to vote
PKDD
2007
Springer
16 years 12 days ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...