5030 search results - page 761 / 1006 » cases 2007 |
150
click to vote
CP
2007
Springer
16 years 26 days 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...
162
click to vote
CP
2007
Springer
16 years 26 days 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...
186
Voted
CPAIOR
2007
Springer
16 years 26 days 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...
179
click to vote
CRYPTO
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
163
click to vote
CSL
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...