9787 search results - page 1869 / 1958 » A Utile Function Optimizer |
FSTTCS
2009
Springer
14 years 21 days ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
GECCO
2009
Springer
14 years 21 days ago
2009
Springer
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
CCO
2001
Springer
14 years 18 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
ISPD
2000
ACM
14 years 14 days ago
2000
ACM
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
DEXAW
1998
IEEE
14 years 11 days ago
1998
IEEE
A mechanistic view of software component assembly implies exact matching and fitting of the particular components. We argue that components for large-scale software construction s...