99 search results - page 19 / 20 » On the Hardness of Planning Problems with Simple Causal Grap... |
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
EPS
1998
Springer
13 years 10 months ago
1998
Springer
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
SIGMOD
2004
ACM
14 years 6 months ago
2004
ACM
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
ICSE
2010
IEEE-ACM
13 years 10 months ago
2010
IEEE-ACM
Statistical debugging uses lightweight instrumentation and statistical models to identify program behaviors that are strongly predictive of failure. However, most software is most...
RECSYS
2010
ACM
13 years 6 months ago
2010
ACM
Social network analysis has attracted increasing attention in recent years. In many social networks, besides friendship links amongst users, the phenomenon of users associating th...