7811 search results - page 1277 / 1563 » computing 2004 |
112
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
122
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
114
click to vote
CPM
2004
Springer
15 years 9 months ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
127
click to vote
CTRSA
2004
Springer
15 years 9 months ago
2004
Springer
We introduce a new cryptographic technique that we call universal re-encryption. A conventional cryptosystem that permits reencryption, such as ElGamal, does so only for a player w...
159
click to vote
DALT
2004
Springer
15 years 9 months ago
2004
Springer
Ad hoc networks may be viewed as computational systems whose members may fail to, or choose not to, comply with the rules governing their behaviour. We are investigating to what ex...