Sciweavers

281 search results - page 13 / 57
» A revealed preference approach to computational complexity i...
Sort
View
ATAL
2009
Springer
14 years 3 months ago
An analysis of feasible solutions for multi-issue negotiation involving nonlinear utility functions
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
IJCNN
2008
IEEE
14 years 3 months ago
Building meta-learning algorithms basing on search controlled by machine complexity
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...
Norbert Jankowski, Krzysztof Grabczewski
WINE
2005
Springer
161views Economy» more  WINE 2005»
14 years 2 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
ACMICEC
2007
ACM
245views ECommerce» more  ACMICEC 2007»
14 years 1 months ago
Keyword generation for search engine advertising using semantic similarity between terms
An important problem in search engine advertising is keyword1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hen...
Vibhanshu Abhishek, Kartik Hosanagar
EUROPAR
2008
Springer
13 years 10 months ago
Reducing Kernel Development Complexity in Distributed Environments
Setting up generic and fully transparent distributed services for clusters implies complex and tedious kernel developments. More flexible approaches such as user-space libraries ar...
Adrien Lebre, Renaud Lottiaux, Erich Focht, Christ...