697 search results - page 113 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
GECCO
2010
Springer
14 years 13 days ago
2010
Springer
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
CHI
2000
ACM
13 years 12 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...
TKDE
2010
13 years 6 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...
ICDM
2008
IEEE
14 years 2 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...
DSN
2002
IEEE
14 years 17 days 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...