Sciweavers

4836 search results - page 950 / 968
» Exploring the Similarity Space
Sort
View
CTCS
1989
Springer
13 years 11 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ELPUB
2007
ACM
13 years 11 months ago
Beyond Publication - A Passage Through Project StORe
The principal aim of Project StORe is to provide middleware that will enable bi-directional links between source repositories of research data and the output repositories containi...
Graham Pryor
GECCO
2007
Springer
206views Optimization» more  GECCO 2007»
13 years 11 months ago
Using code metric histograms and genetic algorithms to perform author identification for software forensics
We have developed a technique to characterize software developers' styles using a set of source code metrics. This style fingerprint can be used to identify the likely author...
Robert Charles Lange, Spiros Mancoridis
ATAL
2006
Springer
13 years 11 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen