Sciweavers

14548 search results - page 198 / 2910
» The Optimal Path-Matching Problem
Sort
View
IIWAS
2003
14 years 5 days ago
Agent-based Problem Solving: The Ant Colonies Metaphor
In this paper the analogy between biological swarms and artificial multiagent systems is pointed out. As an example the steps required to model the artificial optimization techniq...
Stefan Wagner 0002, Michael Affenzeller, Ismail Kh...
NIPS
2003
14 years 4 days 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
DCC
2002
IEEE
14 years 10 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
CP
2009
Springer
14 years 5 months ago
A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem
In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in o...
Helmut Simonis
ICIP
2008
IEEE
14 years 5 months ago
An iterative algorithm for linear inverse problems with compound regularizers
In several imaging inverse problems, it may be of interest to encourage the solution to have characteristics which are most naturally expressed by the combination of more than one...
José M. Bioucas-Dias, Mário A. T. Fi...