283 search results - page 41 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
148
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
129
Voted
SIROCCO
2007
15 years 3 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
113
click to vote
ICPPW
2002
IEEE
15 years 7 months ago
2002
IEEE
generally meta-data, so that documents on any specific subject can be transparently retrieved. While quality control can in principle still rely on the traditional methods of peer-...
140
Voted
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
112
click to vote
AOR
2007
15 years 2 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....