Sciweavers

3367 search results - page 152 / 674
» Incremental assignment problem
Sort
View
INFORMATICALT
2006
110views more  INFORMATICALT 2006»
15 years 3 months ago
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
Gintaras Palubeckis
IPPS
1999
IEEE
15 years 7 months ago
Parallel Ant Colonies for Combinatorial Optimization Problems
Abstract. Ant Colonies AC optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies...
El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Den...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 10 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
CP
1999
Springer
15 years 7 months ago
The Goldilocks Problem
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
Tudor Hulubei, Eugene C. Freuder
99
Voted
COR
2004
127views more  COR 2004»
15 years 3 months ago
Towards the real time solution of strike force asset allocation problems
The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximiz...
Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd