16091 search results - page 2980 / 3219 » Solving |
166
Voted
ISTCS
1997
Springer
15 years 10 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
171
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
169
Voted
PVM
1997
Springer
15 years 10 months ago
1997
Springer
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
151
Voted
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
A data warehouse materializes views derived from data that may not reside at the warehouse. Maintaining these views e ciently in response to base updates is di cult, since it may ...
175
Voted
WLP
1997
Springer
15 years 10 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...