Sciweavers

1814 search results - page 162 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
EVOW
2010
Springer
16 years 1 months ago
A Directed Mutation Operator for Real Coded Genetic Algorithms
Abstract. Developing directed mutation methods has been an interesting research topic to improve the performance of genetic algorithms (GAs) for function optimization. This paper i...
Imtiaz Korejo, Shengxiang Yang, Changhe Li
HM
2007
Springer
120views Optimization» more  HM 2007»
16 years 20 days ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis
EOR
2002
99views more  EOR 2002»
15 years 6 months ago
Network cost minimization using threshold-based discounting
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...
Hrvoje Podnar, Jadranka Skorin-Kapov, Darko Skorin...
CORR
2010
Springer
72views Education» more  CORR 2010»
15 years 3 months ago
X-Armed Bandits
We consider a generalization of stochastic bandit problems where the set of arms, X, is allowed to be a generic topological space. We constraint the mean-payoff function with a di...
Sébastien Bubeck, Rémi Munos, Gilles...
GLOBECOM
2010
IEEE
15 years 4 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun