133 search results - page 23 / 27 » Approximation bounds for Black Hole Search problems |
205
click to vote
VLDB
2006
ACM
15 years 12 months ago
2006
ACM
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
116
click to vote
JAIR
2008
14 years 11 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
182
click to vote
SIGMOD
2005
ACM
15 years 11 months ago
2005
ACM
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
123
click to vote
CEC
2010
IEEE
14 years 3 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
104
click to vote
CDC
2009
IEEE
15 years 23 days ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...