نتایج جستجو برای: backtracking armijo line search

تعداد نتایج: 694472  

2015
Jyoti Yadav Jyoti Chandel Neha Gupta

Scheduling and timetabling problems are multi-constrained constraint satisfaction problems that have huge search space. These problems are NP hard. This paper investigates the use of backtracking approaches to laboratory personnel scheduling problem in which the objective is to assign tasks to employees. The main objective of this work is to search for better solutions than those obtained by au...

Journal: :Incertitudes et fiabilité des systèmes multiphysiques 2017

Journal: :Journal of Artificial Intelligence Research 2009

2004
Roie Zivan Amnon Meisels

A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search processes (SPs) that operate concurrently and scan non-intersecting parts of the global search space. Search processes are generated dynamically, started by the initializing agent, and by any number of agents during searc...

Journal: :Mathematics 2023

This paper presents a modification of the q-BFGS method for nonlinear unconstrained optimization problems. For this modification, we use simple symmetric positive definite matrix and propose new q-quasi-Newton equation, which is close to ordinary equation in limiting case. uses only first order q-derivatives build an approximate q-Hessian over number iterations. The q-Armijo-Wolfe line search c...

Journal: :Discrete Applied Mathematics 2007
Inês Lynce Joao Marques-Silva

This paper proposes the utilization of randomized backtracking within complete backtrack search algorithms for propositional satisfiability (SAT). In recent years, randomization has become pervasive in SAT algorithms. Incomplete algorithms for SAT, for example the ones based on local search, often resort to randomization. Complete algorithms also resort to randomization. These include state-of-...

1998
Narendra Jussien Olivier Lhomme

In this paper, a new search technique over numeric csps is presented: dynamic domain splitting. The usual search technique over numeric csps is a dichotomic search interleaved with a consistency ltering, which is called domain splitting. This paper proposes to replace chronological backtracking at the core of domain splitting by a non destructive backtracking technique.

1998
Christian Bliek

RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB) and partial order dynamic backtracking (PDB) have been presented. These algorithms have the property to be additive on disjoint subproblems and yet use only polynomial space. Unlike DBFPDB only imposes a partial search order and therefore appears to have more freedom than DB to explore the search space. HoweverFboth algorithms ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید