Sciweavers

248 search results - page 40 / 50
» The Relative Complexity of NP Search Problems
Sort
View
WWW
2009
ACM
14 years 8 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 1 months ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals
ERCIMDL
2006
Springer
234views Education» more  ERCIMDL 2006»
13 years 11 months ago
Intelligent Bibliography Creation and Markup for Authors: A Step Towards Interoperable Digital Libraries
The move towards integrated international Digital Libraries offers the opportunity of creating comprehensive data on citation networks. These data are not only invaluable pointers ...
Bettina Berendt, Kai Dingel, Christoph Hanser
CEC
2007
IEEE
14 years 2 months ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
EMSOFT
2009
Springer
13 years 11 months 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