Sciweavers

12825 search results - page 73 / 2565
» Improved PLSOM algorithm
Sort
View
152
Voted
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 7 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
GECCO
2007
Springer
194views Optimization» more  GECCO 2007»
15 years 8 months ago
Hybrid coevolutionary algorithms vs. SVM algorithms
As a learning method support vector machine is regarded as one of the best classifiers with a strong mathematical foundation. On the other hand, evolutionary computational techniq...
Rui Li, Bir Bhanu, Krzysztof Krawiec
106
Voted
SAT
2005
Springer
124views Hardware» more  SAT 2005»
15 years 8 months ago
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
Evgeny Dantsin, Alexander Wolpert
118
Voted
FSTTCS
2003
Springer
15 years 7 months ago
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
Nikhil R. Devanur, Vijay V. Vazirani
120
Voted
JAISE
2010
88views Algorithms» more  JAISE 2010»
14 years 9 months ago
Improving user verification by implementing an agent-based security system
Abstract. This paper presents an agent-based, high-level security system for user verification. The system verifies a user's identity by processing data from several low-lever...
Erik Dovgan, Bostjan Kaluza, Tea Tusar, Matjaz Gam...