1146 search results - page 170 / 230 » Finite cupping sets |
CG
2010
Springer
13 years 8 months ago
2010
Springer
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
PKDD
2010
Springer
13 years 8 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
IFM
2009
Springer
13 years 7 months ago
2009
Springer
Abstract. A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model th...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
IJAMCIGI
2010
13 years 7 months ago
2010
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...