Sciweavers

17688 search results - page 35 / 3538
» Data Set Balancing
Sort
View
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
15 years 8 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
NIPS
2008
15 years 3 months ago
On the Efficient Minimization of Classification Calibrated Surrogates
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
Richard Nock, Frank Nielsen
ESORICS
2009
Springer
16 years 2 months ago
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol
We propose a probabilistic contract signing protocol that achieves balance even in the presence of an adversary that may delay messages sent over secure channels. To show that this...
Mihhail Aizatulin, Henning Schnoor, Thomas Wilke
68
Voted
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
15 years 5 months ago
An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
Adam Berry, Peter Vamplew
IPPS
1999
IEEE
15 years 6 months ago
Reconfigurable Parallel Sorting and Load Balancing: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...
Emmett Davis, Bonnie Holte Bennett, Bill Wren, Lin...