In the last few years, the coevolutionary paradigm has shown an increasing interest thanks to its high ability to manage huge search spaces. Particularly, the cooperative interacti...
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
Traditional hop-by-hop dynamic routing makes inefficient use of network resources as it forwards packets along already congested shortest paths while uncongested longer paths may b...
Minsoo Lee, Xiaohui Ye, Dan Marconett, Samuel John...
In this paper, we look at a supply chain of commodity goods where customer demand is uncertain and partly based on reputation, and where raw material replenishment is uncertain in...
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...