1814 search results - page 188 / 363 » Improved Results on Geometric Hitting Set Problems |
179
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
144
click to vote
ISCIS
2009
Springer
16 years 1 months ago
2009
Springer
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
161
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
165
click to vote
GECCO
2005
Springer
16 years 2 days ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
165
click to vote
ESEM
2008
ACM
15 years 8 months ago
2008
ACM
Software effort estimation techniques abound, each with its own set of advantages and disadvantages, and no one proves to be the single best answer. Combining estimating is an app...