7006 search results - page 88 / 1402 » Approximation Algorithms |
149
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...
109
click to vote
AAAI
2010
15 years 2 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
118
click to vote
ENTCS
2008
15 years 2 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
121
click to vote
RSCTC
2004
Springer
15 years 7 months ago
2004
Springer
A parallel rule-extracting algorithm based on the improved discernibility matrix [2] is proposed, by this way, a large amount of raw data can be divided into some small portions to...