2430 search results - page 237 / 486 » Computing Tutte Polynomials |
115
click to vote
CL
2000
Springer
15 years 8 months ago
2000
Springer
We introduce an algorithm for cooperative planning in multi-agent systems. The algorithm enables the agents to combine (fuse) their plans in order to increase their joint profits...
147
click to vote
COCOON
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
103
click to vote
COCO
1998
Springer
15 years 8 months ago
1998
Springer
We consider the resource bounded measure of polynomial-time learnable subclasses of polynomial-size circuits. We show that if EXP 6= MA, then every PAClearnable subclass of P=poly...
123
click to vote
EUROGP
2008
Springer
15 years 6 months ago
2008
Springer
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
108
click to vote
CCCG
2007
15 years 5 months ago
2007
Given a triangulation of n points, with some triangles marked “good”, this paper discusses the problems of computing the largest-area connected set of good triangles that (i) ...