2031 search results - page 360 / 407 » On Tree-Constrained Matchings and Generalizations |
STOC
2004
ACM
14 years 10 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
WWW
2010
ACM
14 years 4 months ago
2010
ACM
The Web of Data has emerged as a way of exposing structured linked data on the Web. It builds on the central building blocks of the Web (URIs, HTTP) and benefits from its simplic...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
GECCO
2009
Springer
14 years 4 months ago
2009
Springer
A central tenet of embodied artificial intelligence is that intelligent behavior arises out of the coupled dynamics between an agent’s body, brain and environment. It follows t...