Sciweavers

597 search results - page 63 / 120
» Combinatorial Models for Cooperation Networks
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
13 years 16 days ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
ECRA
2010
145views more  ECRA 2010»
13 years 9 months ago
Inferring preference correlations from social networks
Identifying consumer preferences is a key challenge in customizing electronic commerce sites to individual users. The increasing availability of online social networks provides on...
Tad Hogg
IEEEICCI
2003
IEEE
14 years 2 months ago
Mixing Semantic Networks and Conceptual Vectors: The Case of Hyperonymy
In this paper, we focus on lexical semantics, a key issue in Natural Language Processing (NLP) that tends to converge with conceptual Knowledge Representation (KR) and ontologies....
Violaine Prince, Mathieu Lafourcade
EMSOFT
2009
Springer
14 years 28 days ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond