Sciweavers

2266 search results - page 39 / 454
» Some Solutions to the Ignoring Problem
Sort
View
HEURISTICS
2007
165views more  HEURISTICS 2007»
15 years 1 months ago
New heuristics for the maximum diversity problem
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
Geiza C. Silva, Marcos R. Q. de Andrade, Luiz Sato...
HYBRID
2009
Springer
15 years 8 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
CP
2005
Springer
15 years 6 months ago
Weak Symmetries in Problem Formulations
Abstract. In this article we will present some problems that have weak symmetries. In contrast to a proper symmetry, a weak symmetry acts only on a subset of the variables and pres...
Roland Martin, Karsten Weihe
APJOR
2010
112views more  APJOR 2010»
15 years 1 months ago
Sample Average Approximation Methods for a Class of Stochastic Variational inequality Problems
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
Huifu Xu
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 5 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...