697 search results - page 71 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
TIT
2011
13 years 2 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
GG
2008
Springer
13 years 8 months ago
2008
Springer
The model-driven development of model transformations requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, t...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We study the problem of online learning of multiple tasks in parallel. On each online round, the algorithm receives an instance and makes a prediction for each one of the parallel ...