Sciweavers

1996 search results - page 318 / 400
» Financial Theory 2
Sort
View
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
15 years 10 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
FOCS
1990
IEEE
15 years 10 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
CANDC
2009
ACM
15 years 10 months ago
Computational and cognitive infrastructures of stigma: empowering identity in social computing and gaming
Computing technologies such as games, social networking sites, and virtual environments often reproduce forms of social stigma encountered in everyday real life, as well as introd...
D. Fox Harrell
PODC
2010
ACM
15 years 10 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 10 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan