FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2097382020> ?p ?o ?g. }

• W2097382020 abstract "In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. One of the strong points of these methods is that the intuition behind them is fairly simple, which is a definite advantage over many techniques currently in use. The first method, the covering method, can be described as follows: We want to solve a CSP with n variables, each having a domain with d elements. We have access to an algorithm which solves problems where the domain has size e < d, and we want to cover the original problem using a number of restricted instances, in such a way that the solution set is preserved. There are two ways of doing this, depending on the amount of work we are willing to invest; either we construct an explicit covering and end up with a deterministic algorithm for the problem, or we use a probabilistic reasoning and end up with a probabilistic algorithm. The second method, called the partitioning method, relaxes the demand on the underlying algorithm. Instead of having a single algorithm for solving problems with domain less than d, we allow an arbitrary number of them, each solving the problem for a different domain size. Thus by splitting, or partitioning, the domain of the large problem, we again solve a large number of smaller problems before arriving at a solution. Armed with these new techniques, we study a number of different problems; the decision problems (d, l)-CSP and k-Colourability, together with their counting counterparts, as well as the optimisation problems Max Ind CSP, Max Value CSP, Max CSP, and Max Hamming CSP. Among the results, we find a very fast, polynomial space algorithm for determining k-colourability of graphs." @default.
• W2097382020 created "2016-06-24" @default.
• W2097382020 creator A5000958088 @default.
• W2097382020 date "2005-01-01" @default.
• W2097382020 modified "2023-09-23" @default.
• W2097382020 title "Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications" @default.
• W2097382020 cites W104109059 @default.
• W2097382020 cites W114570332 @default.
• W2097382020 cites W1236045544 @default.
• W2097382020 cites W1479863711 @default.
• W2097382020 cites W1483750267 @default.
• W2097382020 cites W1494491461 @default.
• W2097382020 cites W1498006595 @default.
• W2097382020 cites W1501301539 @default.
• W2097382020 cites W1504850494 @default.
• W2097382020 cites W1507601075 @default.
• W2097382020 cites W1507652610 @default.
• W2097382020 cites W1508924483 @default.
• W2097382020 cites W1509149194 @default.
• W2097382020 cites W1511646990 @default.
• W2097382020 cites W1515040271 @default.
• W2097382020 cites W1515101020 @default.
• W2097382020 cites W1530753374 @default.
• W2097382020 cites W1533138303 @default.
• W2097382020 cites W1535530436 @default.
• W2097382020 cites W1535937474 @default.
• W2097382020 cites W1536779655 @default.
• W2097382020 cites W1544515183 @default.
• W2097382020 cites W1553069021 @default.
• W2097382020 cites W1557447388 @default.
• W2097382020 cites W1563127428 @default.
• W2097382020 cites W1565010992 @default.
• W2097382020 cites W1566410171 @default.
• W2097382020 cites W1570383166 @default.
• W2097382020 cites W1571792361 @default.
• W2097382020 cites W1572797009 @default.
• W2097382020 cites W1583449596 @default.
• W2097382020 cites W1584186420 @default.
• W2097382020 cites W158508907 @default.
• W2097382020 cites W1585544221 @default.
• W2097382020 cites W1588518880 @default.
• W2097382020 cites W1589828224 @default.
• W2097382020 cites W1593169756 @default.
• W2097382020 cites W1593916827 @default.
• W2097382020 cites W1596358429 @default.
• W2097382020 cites W1599664260 @default.
• W2097382020 cites W1600387673 @default.
• W2097382020 cites W1607251184 @default.
• W2097382020 cites W160762968 @default.
• W2097382020 cites W1627230931 @default.
• W2097382020 cites W164441653 @default.
• W2097382020 cites W1654509763 @default.
• W2097382020 cites W1656795039 @default.
• W2097382020 cites W1685626019 @default.
• W2097382020 cites W1686746446 @default.
• W2097382020 cites W1793685185 @default.
• W2097382020 cites W1806421751 @default.
• W2097382020 cites W1964821516 @default.
• W2097382020 cites W1970461358 @default.
• W2097382020 cites W1971483538 @default.
• W2097382020 cites W1975442866 @default.
• W2097382020 cites W1977312644 @default.
• W2097382020 cites W1979740015 @default.
• W2097382020 cites W1982174487 @default.
• W2097382020 cites W1982687611 @default.
• W2097382020 cites W1984481156 @default.
• W2097382020 cites W1985123706 @default.
• W2097382020 cites W1989682699 @default.
• W2097382020 cites W1990313671 @default.
• W2097382020 cites W1996980357 @default.
• W2097382020 cites W1999038767 @default.
• W2097382020 cites W2002892545 @default.
• W2097382020 cites W2006912660 @default.
• W2097382020 cites W2007200873 @default.
• W2097382020 cites W2009384947 @default.
• W2097382020 cites W2010438070 @default.
• W2097382020 cites W2011039300 @default.
• W2097382020 cites W2013568176 @default.
• W2097382020 cites W2016639451 @default.
• W2097382020 cites W2022191808 @default.
• W2097382020 cites W2022212237 @default.
• W2097382020 cites W2024060531 @default.
• W2097382020 cites W2027049731 @default.
• W2097382020 cites W2027506801 @default.
• W2097382020 cites W2027896828 @default.
• W2097382020 cites W2031823362 @default.
• W2097382020 cites W2034111852 @default.
• W2097382020 cites W2034674470 @default.
• W2097382020 cites W2040145343 @default.
• W2097382020 cites W2043193943 @default.
• W2097382020 cites W2043506441 @default.
• W2097382020 cites W2045492613 @default.
• W2097382020 cites W204713183 @default.
• W2097382020 cites W2047674557 @default.
• W2097382020 cites W2049500052 @default.
• W2097382020 cites W2050430186 @default.
• W2097382020 cites W2055839883 @default.
• W2097382020 cites W2057361103 @default.
• W2097382020 cites W2063379221 @default.
• W2097382020 cites W2066749637 @default.

• next