Sciweavers

3367 search results - page 171 / 674
» Incremental assignment problem
Sort
View
163
Voted
WWW
2008
ACM
15 years 3 months ago
A Novelty-based Clustering Method for On-line Documents
In this paper, we describe a document clustering method called noveltybased document clustering. This method clusters documents based on similarity and novelty. The method assigns...
Sophoin Khy, Yoshiharu Ishikawa, Hiroyuki Kitagawa
144
Voted
JCS
2011
138views more  JCS 2011»
14 years 6 months ago
Automatic analysis of malware behavior using machine learning
Malicious software—so called malware—poses a major threat to the security of computer systems. The amount and diversity of its variants render classic security defenses ineffe...
Konrad Rieck, Philipp Trinius, Carsten Willems, Th...
157
Voted
CEC
2011
IEEE
14 years 3 months ago
On universal search strategies for multi-criteria optimization using weighted sums
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
Julien Legriel, Scott Cotton, Oded Maler
PODC
2009
ACM
16 years 3 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
128
Voted
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
15 years 9 months ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang