Sciweavers

14158 search results - page 229 / 2832
» Generalized switch-setting problems
Sort
View
146
Voted
EAAI
2008
104views more  EAAI 2008»
15 years 3 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
SAC
1997
ACM
15 years 8 months ago
Crozzle: an NP-complete problem
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
David Binkley, Bradley M. Kuhn
DISOPT
2008
89views more  DISOPT 2008»
15 years 3 months ago
A pricing problem under Monge property
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
Oktay Günlük
142
Voted
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
15 years 10 months ago
Two adaptive mutation operators for optima tracking in dynamic optimization problems with evolution strategies
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
Claudio Rossi, Antonio Barrientos, Jaime del Cerro
153
Voted
ICICIC
2006
IEEE
15 years 9 months ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei