Sciweavers

16504 search results - page 22 / 3301
» New Problems, New Solutions
Sort
View
EVOW
2004
Springer
15 years 7 months ago
New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
Thomas Stützle, Susana Fernandes
120
Voted
TON
2012
13 years 4 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...
ICML
2005
IEEE
16 years 2 months ago
New approaches to support vector ordinal regression
In this paper, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal ...
Wei Chu, S. Sathiya Keerthi
IROS
2009
IEEE
176views Robotics» more  IROS 2009»
15 years 8 months ago
A new modular schema for the control of tumbling robots
— Tumbling is an exciting new area of robotic locomotion that takes advantage of ground-body interactions to achieve rich motions with minimal hardware complexity. The increased ...
Brett Hemes, Nikolaos Papanikolopoulos
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 5 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro