1995 search results - page 211 / 399 » What's the Problem |
140
Voted
ICS
2010
Tsinghua U.
15 years 8 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
177
Voted
SPAA
1994
ACM
15 years 8 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
118
click to vote
ASIACRYPT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Tweakable blockciphers, first formalized by Liskov, Rivest, and Wagner [13], are blockciphers with an additional input, the tweak, which allows for variability. An open p...
140
click to vote
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
167
Voted
EDOC
2009
IEEE
15 years 8 months ago
2009
IEEE
A key challenge in devising solutions to a range of problems associated with business process management: process life cycle management, compliance management, enterprise process ...