346 search results - page 49 / 70 » Solving quantified constraint satisfaction problems |
SGAI
2007
Springer
15 years 3 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
SAC
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
IJCNN
2006
IEEE
15 years 3 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...
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--Current multibeam satellite systems perform centralized power and carrier allocation assuming a Multi-Frequency Time Division Multiple Access (MF-TDMA) scheme with fixed ...
ICTAI
2007
IEEE
15 years 3 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...