Sciweavers

1092 search results - page 137 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
16 years 13 days ago
A building-block royal road where crossover is provably essential
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
Richard A. Watson, Thomas Jansen
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
16 years 12 days ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
15 years 4 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
ECRTS
2009
IEEE
15 years 4 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan
AAAI
2004
15 years 7 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...