12194 search results - page 80 / 2439 » Numberings Optimal for Learning |
94
Voted
DEXAW
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
CHI
1999
ACM
15 years 5 months ago
1999
ACM
The proliferation of multiple toolbars and UI widgets around the perimeter of application windows is an indication that the traditional GUI design of a single menubar is not suffi...
111
click to vote
CORR
2010
Springer
15 years 21 days ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
103
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Deciding the appropriate population size and number of islands for distributed island-model genetic algorithms is often critical to the algorithm’s success. This paper outlines ...
109
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...