697 search results - page 113 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
172
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
141
click to vote
CHI
2000
ACM
15 years 9 months ago
2000
ACM
We discuss a novel type of interface, the intelligent gazeadded interface, and describe the design and evaluation of a sample gaze-added operating-system interface. Gaze-added int...
154
click to vote
TKDE
2010
15 years 3 months ago
2010
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
158
click to vote
ICDM
2008
IEEE
15 years 12 months ago
2008
IEEE
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
157
click to vote
DSN
2002
IEEE
15 years 10 months ago
2002
IEEE
As our reliance on computers increases, so does the need for robust software. Previous studies have shown that many C libraries exhibit robustness problems due to exceptional inpu...