14699 search results - page 2814 / 2940 » Complexity and Cognitive Computing |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
OOPSLA
2009
Springer
14 years 2 months ago
2009
Springer
Software correctness has bedeviled the field of computer science since its inception. Software complexity has increased far more quickly than our ability to control it, reaching ...
SSD
2009
Springer
14 years 2 months ago
2009
Springer
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
CHIMIT
2009
ACM
14 years 2 months ago
2009
ACM
End users are often frustrated by unexpected problems while using networked software, leading to frustrated calls to the help desk seeking solutions. However, trying to locate the...