Sciweavers

1547 search results - page 15 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
IDA
2005
Springer
14 years 1 months ago
Miner Ants Colony: A New Approach to Solve a Mine Planning Problem
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
María-Cristina Riff, Michael Moossen, Xavie...
ICASSP
2010
IEEE
13 years 7 months ago
On the robustness of the multidimensional state coherence transform for solving the permutation problem of frequency-domain ICA
A common problem in frequency domain independent component analysis (ICA) is the so called permutation problem which arises due to the independent demixing in each frequency bin. ...
Benedikt Loesch, Francesco Nesta, Bin Yang
IGARSS
2009
13 years 5 months ago
Complex Wavelet Regularization for Solving Inverse Problems in Remote Sensing
Many problems in remote sensing can be modeled as the minimization of the sum of a data term and a prior term. We propose to use a new complex wavelet based prior and an efficient...
Mikael Carlavan, Pierre Weiss, Laure Blanc-F&eacut...
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 23 days ago
Multi-Agent Systems and Microeconomic Theory: A Negotiation Approach to Solve Scheduling Problems in High Dynamic Environments
Microeconomics offer a far developed theory on the subject of rational choice. This theory is applied to a multi-agent system, which has been modeled in order to establish schedul...
Hans Czap, Marc Becker
TPDS
2002
80views more  TPDS 2002»
13 years 7 months ago
Performance Optimization Problem in Speculative Prefetching
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...