348 search results - page 59 / 70 » Using Constraint Networks on Timelines to Model and Solve Pl... |
AI
2000
Springer
13 years 7 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
IPSN
2005
Springer
14 years 28 days ago
2005
Springer
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to deter...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
CP
2006
Springer
13 years 11 months ago
2006
Springer
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...