We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
We present and analyze an agnostic active learning algorithm that works without keeping a version space. This is unlike all previous approaches where a restricted set of candidate...
Alina Beygelzimer, Daniel Hsu, John Langford, Tong...
Without shared understanding, hardly any group learning takes place. Though much has been written about the essence of shared understanding, less is known about how to assess the ...
Researchers in the eld of Distributed Arti cial Intelligence (DAI) have been developing e cient mechanisms to coordinate the activities of multiple autonomous agents. The need for...