4903 search results - page 231 / 981 » The Set Covering Machine |
189
Voted
BMCBI
2004
15 years 6 months ago
2004
Background: The current progress in sequencing projects calls for rapid, reliable and accurate function assignments of gene products. A variety of methods has been designed to ann...
178
Voted
VLDB
2002
ACM
15 years 5 months ago
2002
ACM
Extensibility is one of the mayor benefits of object-relational database management systems. We have used this system property to implement a StateMachine Module inside an object-...
150
click to vote
EUROGP
1999
Springer
15 years 10 months ago
1999
Springer
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962. In this paper we propose an evolutionary approach to this problem. We will focus on the representati...
189
Voted
ESA
2000
Springer
15 years 9 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
163
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...