1088 search results - page 1 / 218 » A Bayesian Approach to Tackling Hard Computational Problems |
UAI
2001
14 years 11 months ago
2001
CG
2002
Springer
14 years 10 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
EVOW
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...
IWINAC
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
RTCSA
2005
IEEE
15 years 3 months ago
2005
IEEE
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...