Sciweavers

929 search results - page 33 / 186
» heuristics 2008
Sort
View
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
CP
2008
Springer
13 years 9 months ago
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
Wanxia Wei, Chu Min Li, Harry Zhang
INFOCOM
2008
IEEE
14 years 2 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
SIGKDD
2008
93views more  SIGKDD 2008»
13 years 7 months ago
Breast cancer identification: KDD CUP winner's report
We describe the ideas and methodologies that we developed in addressing the KDD Cup 2008 on early breast cancer detection, and discuss how they contributed to our success. The mos...
Claudia Perlich, Prem Melville, Yan Liu 0002, Grze...
AIPS
2009
13 years 8 months ago
Preferred Operators and Deferred Evaluation in Satisficing Planning
Heuristic forward search is the dominant approach to satisficing planning to date. Most successful planning systems, however, go beyond plain heuristic search by employing various...
Silvia Richter, Malte Helmert