17329 search results - page 181 / 3466 » Improved non-approximability results |
BPM
2005
Springer
14 years 2 days ago
2005
Springer
Abstract. This paper aims at carrying out business process modelling and business process improvement using TAD methodology. The methodology consists of six phases; the first three...
IJCAI
1997
13 years 11 months ago
1997
Most research in learning for planning has concentrated on efficiency gains. Another important goal is improving the quality of final plans. Learning to improve plan quality has b...
LICS
2009
IEEE
14 years 4 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
DEXAW
2007
IEEE
14 years 4 months ago
2007
IEEE
Hyperlink Structure is widely used in the hypertext classification, but it has not been paid enough attention. We propose a hyperlink classification approach to improve PageRank a...
CRYPTO
2005
Springer
14 years 3 months ago
2005
Springer
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...