Sciweavers

1174 search results - page 40 / 235
» Optimizing generics is easy!
Sort
View
COCOON
2007
Springer
14 years 4 months ago
On the Hardness of Optimization in Power Law Graphs
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
Alessandro Ferrante, Gopal Pandurangan, Kihong Par...
NIPS
1993
13 years 11 months ago
Optimal Stochastic Search and Adaptive Momentum
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
Todd K. Leen, Genevieve B. Orr
JDA
2007
83views more  JDA 2007»
13 years 9 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
SIGMOD
2002
ACM
141views Database» more  SIGMOD 2002»
13 years 9 months ago
Bringing Order to Query Optimization
A variety of developments combine to highlight the need for respecting order when manipulating relations. For example, new functionality is being added to SQL to support OLAP-styl...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
13 years 7 months ago
Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...
Francesc Comellas, Jesus Martinez-Navarro