Sciweavers

13376 search results - page 394 / 2676
» Problem Solving with
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 8 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 9 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
TC
1998
15 years 4 months ago
Toward Correctly Rounded Transcendentals
—The Table Maker’s Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we pr...
Vincent Lefèvre, Jean-Michel Muller, Arnaud...
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
15 years 11 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw
PRDC
2007
IEEE
15 years 11 months ago
An Automatic Real-Time Analysis of the Time to Reach Consensus
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
Tatsuhiro Tsuchiya, André Schiper