Sciweavers

1547 search results - page 38 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
NMA
2010
13 years 5 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
IJCNN
2000
IEEE
13 years 12 months ago
Fog Forecasting Using Self Growing Neural Network 'CombNET-II: ' A Solution for Imbalanced Training Sets Problem
This paper proposes a method to solve problem that comes with imbalanced training sets which is often seen in the practical applications. We modi ed Self Growing Neural Network Co...
Anto Satriyo Nugroho, Susumu Kuroyanagi, Akira Iwa...
FUIN
2010
109views more  FUIN 2010»
13 years 6 months ago
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
António Morgado, João Marques-Silva
MOBIHOC
2010
ACM
13 years 5 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
SIAMNUM
2010
105views more  SIAMNUM 2010»
13 years 2 months ago
Quantization Based Filtering Method Using First Order Approximation
The quantization based filtering method (see [13], [14]) is a grid based approximation method to solve nonlinear filtering problems with discrete time observations. It relies on o...
Afef Sellami