Sciweavers

10493 search results - page 384 / 2099
» Dynamic Word Problems
Sort
View
DISOPT
2006
118views more  DISOPT 2006»
15 years 6 months ago
Improved bounds for vehicle routing solutions
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
Agustín Bompadre, Moshe Dror, James B. Orli...
IPL
2007
125views more  IPL 2007»
15 years 6 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
GIS
2007
ACM
16 years 7 months ago
Dynamic storage balancing in a distributed spatial index
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...
Cédric du Mouza, Philippe Rigaux, Witold Li...
ICML
2005
IEEE
16 years 7 months ago
Dynamic preferences in multi-criteria reinforcement learning
The current framework of reinforcement learning is based on maximizing the expected returns based on scalar rewards. But in many real world situations, tradeoffs must be made amon...
Sriraam Natarajan, Prasad Tadepalli
158
Voted
CHI
2005
ACM
16 years 7 months ago
Beyond "from" and "received": exploring the dynamics of email triage
Email triage is the process of going through unhandled email and deciding what to do with it. Email triage can quickly become a serious problem for users as the amount of unhandle...
Carman Neustaedter, A. J. Bernheim Brush, Marc A. ...