Sciweavers

100 search results - page 16 / 20
» New complexity results for time-constrained dynamical optima...
Sort
View
SAB
2004
Springer
159views Optimization» more  SAB 2004»
14 years 3 months ago
Swarming Behavior Using Probabilistic Roadmap Techniques
While techniques exist for simulating swarming behaviors, these methods usually provide only simplistic navigation and planning capabilities. In this review, we explore the benefi...
O. Burçhan Bayazit, Jyh-Ming Lien, Nancy M....
AAAI
1997
13 years 11 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
IWQOS
2001
Springer
14 years 2 months ago
QoS-Aware Adaptive Services in Mobile Ad-Hoc Networks
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...
Baochun Li
TPDS
2008
72views more  TPDS 2008»
13 years 9 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert