Sciweavers

1080 search results - page 167 / 216
» Problem dependent optimization (PDO)
Sort
View
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 4 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
ATAL
2005
Springer
15 years 9 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 9 months ago
Expressive negotiation over donations to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
Vincent Conitzer, Tuomas Sandholm
CORR
2002
Springer
166views Education» more  CORR 2002»
15 years 3 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
RC
1998
82views more  RC 1998»
15 years 3 months ago
A Note on Epsilon-Inflation
Abstract. The epsilon-inflation proved to be useful and necessary in many verification algorithms. Different definitions of an epsilon-inflation are possible, depending on the...
Siegfried M. Rump