2393 search results - page 43 / 479 » Bounds-Consistent Local Search |
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
CG
1998
Springer
13 years 12 months ago
1998
Springer
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
AI
2003
Springer
14 years 28 days ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...