Sciweavers

1977 search results - page 23 / 396
» The satisfactory partition problem
Sort
View
WG
2007
Springer
15 years 12 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
NIPS
2003
15 years 7 months ago
Feature Selection in Clustering Problems
A novel approach to combining clustering and feature selection is presented. It implements a wrapper strategy for feature selection, in the sense that the features are directly se...
Volker Roth, Tilman Lange
FSKD
2006
Springer
203views Fuzzy Logic» more  FSKD 2006»
15 years 9 months ago
An Interval Semi-absolute Deviation Model For Portfolio Selection
Interval number is a kind of special fuzzy number and the interval approach is a good method to deal with some uncertainty. The semi-absolute deviation risk function is extended to...
Yong Fang, Shouyang Wang
ICICIC
2006
IEEE
15 years 11 months ago
Timetable Scheduling Using Particle Swarm Optimization
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...
Shu-Chuan Chu, Yi-Tin Chen, Jiun-Huei Ho
138
Voted
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
15 years 11 months ago
New Epistasis Measures for Detecting Independently Optimizable Partitions of Variables
An optimization problem is often represented with a set of variables, and the interaction between the variables is referred to as epistasis. In this paper, we propose two new measu...
Dong-il Seo, Sung-Soon Choi, Byung Ro Moon