Sciweavers

2313 search results - page 9 / 463
» On Heuristic Time Hierarchies
Sort
View
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 12 months ago
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
Richard Beigel, Bin Fu
ICDE
2008
IEEE
121views Database» more  ICDE 2008»
16 years 1 months ago
Optimizing Hierarchical Access in OLAP Environment
In Online Analytic Processing (OLAP) deployments, different users, lines of businesses and business units often create adhoc aggregation hierarchies tailor-made for specific report...
Lipyeow Lim, Bishwaranjan Bhattacharjee
JAMDS
2002
155views more  JAMDS 2002»
14 years 11 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner
NLDB
2007
Springer
15 years 6 months ago
Developing Methods and Heuristics with Low Time Complexities for Filtering Spam Messages
In this paper, we propose methods and heuristics having high accuracies and low time complexities for filtering spam e-mails. The methods are based on the n-gram approach and a heu...
Tunga Güngör, Ali Çiltik