Sciweavers

1275 search results - page 116 / 255
» time 1998
Sort
View
IPCO
1998
99views Optimization» more  IPCO 1998»
13 years 10 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
SIGKDD
2000
95views more  SIGKDD 2000»
13 years 8 months ago
Scalability for Clustering Algorithms Revisited
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...
Fredrik Farnstrom, James Lewis, Charles Elkan
AI
1998
Springer
13 years 8 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
13 years 8 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
TC
1998
13 years 8 months ago
Analysis of Preventive Maintenance in Transactions Based Software Systems
—Preventive maintenance of operational software systems, a novel technique for software fault tolerance, is used specifically to counteract the phenomenon of software “aging....
Sachin Garg, Antonio Puliafito, Miklós Tele...