4438 search results - page 721 / 888 » The Case for Collaborative Programming |
122
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
128
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
144
click to vote
CPAIOR
2007
Springer
15 years 11 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
144
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
133
Voted
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...