14165 search results - page 215 / 2833 » The generalized two-server problem |
210
click to vote
EAAI
2008
15 years 7 months ago
2008
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...
173
Voted
SAC
1997
ACM
15 years 11 months ago
1997
ACM
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...
199
Voted
DISOPT
2008
15 years 7 months ago
2008
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...
210
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
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...
215
click to vote
ICICIC
2006
IEEE
16 years 1 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...