455 search results - page 69 / 91 » Approximation Algorithms for Partial Covering Problems |
154
Voted
CLA
2007
15 years 7 months ago
2007
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
164
Voted
UAI
2008
15 years 7 months ago
2008
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
152
click to vote
ALGOSENSORS
2007
Springer
16 years 15 days ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
137
click to vote
ICOIN
2004
Springer
15 years 11 months ago
2004
Springer
In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce...
172
Voted
NIPS
2007
15 years 7 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...