Sciweavers

70 search results - page 9 / 14
» Optimal Route Planning under Uncertainty
Sort
View
JSAC
2007
125views more  JSAC 2007»
14 years 9 months ago
Network Dimensioning under Scheduled and Random Lightpath Demands in All-Optical WDM Networks
— In WDM optical networks connection requests can be classified into three different types: Permanent Lightpath Demands (PLDs), Scheduled Lightpath Demands (SLDs), and Random Li...
Maurice Gagnaire, Mohamed Koubàa, Nicolas P...
CP
2004
Springer
15 years 3 months ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...
AIPS
2006
14 years 11 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
ICTAI
2009
IEEE
14 years 7 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
ICCNMC
2005
Springer
15 years 3 months ago
Sensor Network Configuration Under Physical Attacks
— In this paper, we address a sensor network lifetime problem that maintains a certain throughput in an environment where physical node destruction is possible. While lifetime is...
Xun Wang, Wenjun Gu, Kurt Schosek, Sriram Chellapp...