5995 search results - page 899 / 1199 » Algorithmic Game Theory |
145
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
141
click to vote
HIPC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
156
click to vote
ICB
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. As an important feature of fingerprints, singular points (includingcores and deltas) not only represent the local ridge pattern characteristics, but also determine the to...
178
Voted
LOPSTR
2007
Springer
15 years 11 months ago
2007
Springer
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
130
click to vote
SEMWEB
2007
Springer
15 years 11 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...