Sciweavers

3413 search results - page 154 / 683
» New Support Vector Algorithms
Sort
View
GECCO
2005
Springer
197views Optimization» more  GECCO 2005»
15 years 12 months ago
Breeding swarms: a GA/PSO hybrid
Abstract. In this paper we propose a novel hybrid (GA/PSO) algorithm, Breeding Swarm, combining the strengths of particle swarm optimization with genetic algorithms. The hybrid alg...
Matthew Settles, Terence Soule
ESOP
2005
Springer
15 years 12 months ago
A New Foundation for Control-Dependence and Slicing for Modern Program Structures
The notion of control dependence underlies many program analysis and transformation techniques used in numerous applications. Despite wide application, existing definitions and ap...
Venkatesh Prasad Ranganath, Torben Amtoft, Anindya...
ESANN
2004
15 years 7 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
16 years 21 days ago
A New Cross Layer Approach to QoS-Aware Proportional Fairness Packet Scheduling in the Downlink of OFDM Wireless Systems
—OFDM systems are the major cellular platforms for supporting ubiquitous high performance mobile applications. However, there remain a number of research challenges to be tackled...
Zhen Kong, Jiangzhou Wang, Yu-Kwong Kwok
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
15 years 12 months ago
New Results on the Complexity of the Middle Bit of Multiplication
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
Ingo Wegener, Philipp Woelfel