572 search results - page 80 / 115 » Exponential-Time Approximation of Hard Problems |
ESA
2009
Springer
15 years 2 months ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
IJBRA
2008
14 years 10 months ago
2008
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
104
click to vote
GPEM
2010
14 years 8 months ago
2010
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
JCO
2010
14 years 8 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...