2233 search results - page 407 / 447 » On the Complexity of Theory Curbing |
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
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...