Sciweavers

2194 search results - page 20 / 439
» Improving HLRTA*( k )
Sort
View
COCOON
2006
Springer
14 years 2 months ago
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yu...
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
14 years 11 months ago
Lower bounds for k-DNF resolution on random 3-CNFs
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
Michael Alekhnovich
ICIC
2005
Springer
14 years 4 months ago
Methods of Decreasing the Number of Support Vectors via k-Mean Clustering
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...
Xiao-Lei Xia, Michael R. Lyu, Tat-Ming Lok, Guang-...
IAJIT
2008
115views more  IAJIT 2008»
13 years 11 months ago
A Novel Mechanism to Improve Performance of TCP Protocol over Asymmetric Networks
: In this paper, TCP performance issues in bandwidth asymmetric networks are investigated. Related works to improve TCP performance in bandwidth asymmetric networks are introduced ...
Wissam Al-Khatib, K. Gunavathi
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 10 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...