10447 search results - page 2016 / 2090 » The Philosophy of Computer Science |
161
click to vote
FSTTCS
2009
Springer
16 years 18 days 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) ...
183
click to vote
FSTTCS
2009
Springer
16 years 18 days ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
173
click to vote
GECCO
2009
Springer
16 years 18 days ago
2009
Springer
Embodied cognition emphasizes that intelligent behavior results from the coupled dynamics between an agent’s body, brain and environment. In response to this, several projects h...
190
click to vote
ICMT
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...
172
click to vote
COMPGEOM
2009
ACM
16 years 16 days 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...