1805 search results - page 209 / 361 » Functional programming with structured graphs |
126
click to vote
SAGT
2010
Springer
14 years 12 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
GI
2007
Springer
15 years 7 months ago
2007
Springer
: Several algorithms are common for estimating depth from stereo series, but many of them have difficulties when determining depth of objects having periodical structure. This con...
109
click to vote
ICSE
2008
IEEE-ACM
16 years 2 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
107
click to vote
EVOW
2007
Springer
15 years 7 months ago
2007
Springer
We present several practical improvements to the interactive evolution of 2D images, some of which are also applicable to more general genetic programming problems. We introduce tr...
110
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...