843 search results - page 137 / 169 » Introducing the Iteration in sPBC |
154
click to vote
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
209
click to vote
FOSSACS
2001
Springer
15 years 10 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
172
click to vote
COCO
2000
Springer
15 years 10 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
161
click to vote
ADC
1999
Springer
15 years 10 months ago
1999
Springer
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...
179
click to vote
ML
2000
ACM
15 years 5 months ago
2000
ACM
This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. ...