FRINK Linked Data Fragments server

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

• W1523311306 endingPage "25" @default.
• W1523311306 startingPage "1" @default.
• W1523311306 abstract "NP-complete problems are particularly hard to solve. Unless P=NP, any algorithm solving an NP-complete problem takes exponential time in the worst case. The intrinsic difficulty of NP-complete problems when we try to optimally solve them with computers seems to apply to humans too. Intuitively, solving NP-complete problems requires taking a series of choices where each choice we take disables many subsequent choices, but the scope of dependencies between these mutually exclusive choices cannot be bound. Thus, the problem cannot be split into smaller subproblems in such a way that their solutions can be computed independently and easily combined for constructing the global solution as it happens in divide and conquer algorithms. Moreover, for each choice, the space of subsequent subproblems to be considered for all possible choice elections does not collapse into a polynomial size set as it happens in dynamic programming algorithms. Thus, intuitively, in NP-complete problems any choice may unboundedly affect any other, and this difficulty seems to puzzle humans as much as computers. In this paper we conduct an experiment to systematically analyze the performance of humans when solving NP-complete problems. For each problem, in order to measure partial fulfillment of the decision problem goal, we consider its NP-hard optimization version. We analyze the human capability to compute good suboptimal solutions to these problems, we try to identify the kind of problem instances which make humans compute the best and worst solutions including the dependance of their performance on the size of problem instances, and we compare their performance with computational heuristics typically used to approximately solve these problems. We also interview experiment participants in order to infer the most typical strategies used by them in experiments, as well as how these strategies depend on the form and size of problem instances." @default.
• W1523311306 created "2016-06-24" @default.
• W1523311306 creator A5059087539 @default.
• W1523311306 creator A5070208947 @default.
• W1523311306 creator A5070504350 @default.
• W1523311306 creator A5080808845 @default.
• W1523311306 date "2013-01-01" @default.
• W1523311306 modified "2023-10-13" @default.
• W1523311306 title "Comparing Problem Solving Strategies for NP-hard Optimization Problems" @default.
• W1523311306 cites W113282148 @default.
• W1523311306 cites W1522578222 @default.
• W1523311306 cites W1573676079 @default.
• W1523311306 cites W1968994430 @default.
• W1523311306 cites W1973415219 @default.
• W1523311306 cites W2011039300 @default.
• W1523311306 cites W2024060531 @default.
• W1523311306 cites W2026891055 @default.
• W1523311306 cites W2036265926 @default.
• W1523311306 cites W2043751102 @default.
• W1523311306 cites W2053079614 @default.
• W1523311306 cites W2053913299 @default.
• W1523311306 cites W2092439775 @default.
• W1523311306 cites W2110367141 @default.
• W1523311306 cites W2117537240 @default.
• W1523311306 cites W2151362199 @default.
• W1523311306 cites W2157737584 @default.
• W1523311306 cites W2166843422 @default.
• W1523311306 cites W2179622958 @default.
• W1523311306 cites W2904250082 @default.
• W1523311306 cites W3023540311 @default.
• W1523311306 cites W2511492187 @default.
• W1523311306 doi "https://doi.org/10.3233/fi-2013-822" @default.
• W1523311306 hasPublicationYear "2013" @default.
• W1523311306 type Work @default.
• W1523311306 sameAs 1523311306 @default.
• W1523311306 citedByCount "11" @default.
• W1523311306 countsByYear W15233113062013 @default.
• W1523311306 countsByYear W15233113062017 @default.
• W1523311306 countsByYear W15233113062018 @default.
• W1523311306 countsByYear W15233113062020 @default.
• W1523311306 countsByYear W15233113062021 @default.
• W1523311306 crossrefType "journal-article" @default.
• W1523311306 hasAuthorship W1523311306A5059087539 @default.
• W1523311306 hasAuthorship W1523311306A5070208947 @default.
• W1523311306 hasAuthorship W1523311306A5070504350 @default.
• W1523311306 hasAuthorship W1523311306A5080808845 @default.
• W1523311306 hasConcept C11413529 @default.
• W1523311306 hasConcept C122749075 @default.
• W1523311306 hasConcept C126255220 @default.
• W1523311306 hasConcept C137836250 @default.
• W1523311306 hasConcept C179799912 @default.
• W1523311306 hasConcept C33923547 @default.
• W1523311306 hasConcept C41008148 @default.
• W1523311306 hasConceptScore W1523311306C11413529 @default.
• W1523311306 hasConceptScore W1523311306C122749075 @default.
• W1523311306 hasConceptScore W1523311306C126255220 @default.
• W1523311306 hasConceptScore W1523311306C137836250 @default.
• W1523311306 hasConceptScore W1523311306C179799912 @default.
• W1523311306 hasConceptScore W1523311306C33923547 @default.
• W1523311306 hasConceptScore W1523311306C41008148 @default.
• W1523311306 hasIssue "1-2" @default.
• W1523311306 hasLocation W15233113061 @default.
• W1523311306 hasOpenAccess W1523311306 @default.
• W1523311306 hasPrimaryLocation W15233113061 @default.
• W1523311306 hasRelatedWork W188711498 @default.
• W1523311306 hasRelatedWork W2000789321 @default.
• W1523311306 hasRelatedWork W2897562745 @default.
• W1523311306 hasRelatedWork W2999460072 @default.
• W1523311306 hasRelatedWork W3104770499 @default.
• W1523311306 hasRelatedWork W3217415483 @default.
• W1523311306 hasRelatedWork W4255006213 @default.
• W1523311306 hasRelatedWork W4285140130 @default.
• W1523311306 hasRelatedWork W4285677055 @default.
• W1523311306 hasRelatedWork W4312509357 @default.
• W1523311306 hasVolume "124" @default.
• W1523311306 isParatext "false" @default.
• W1523311306 isRetracted "false" @default.
• W1523311306 magId "1523311306" @default.
• W1523311306 workType "article" @default.