Sciweavers

432 search results - page 23 / 87
» An optimal algorithm for the distinct elements problem
Sort
View
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
14 years 3 months ago
Optimal Subsequence Bijection
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
Longin Jan Latecki, Qiang Wang, Suzan Koknar-Tezel...
ICALP
2009
Springer
14 years 9 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
ECAI
2008
Springer
13 years 10 months ago
Optimal Coalition Structure Generation In Partition Function Games
1 In multi-agent systems (MAS), coalition formation is typically studied using characteristic function game (CFG) representations, where the performance of any coalition is indepen...
Tomasz P. Michalak, Andrew Dowell, Peter McBurney,...
CEC
2008
IEEE
14 years 3 months ago
Mesh dependency of stress-based crossover for structural topology optimization
— This paper presents a genetic algorithm (GA) with a stress-based crossover (SX) operator to obtain a solution without checkerboard patterns for multi-constrained topology optim...
Cuimin Li, Tomoyuki Hiroyasu, Mitsunori Miki
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