36 search results - page 7 / 8 » Computational Complexity of Weighted Threshold Games |
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
IV
2009
IEEE
13 years 12 months ago
2009
IEEE
A lexical network is a very useful resource for natural language processing systems. However, building high quality lexical networks is a complex task. “Jeux de mots” is a web...
FOCS
2008
IEEE
13 years 5 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
IJON
2007
13 years 5 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...