標(biāo)題: Titlebook: Constraint-Based Design Recovery for Software Reengineering; Theory and Experimen Steven G. Woods,Alexander E. Quilici,Qiang Yang Book 1998 [打印本頁(yè)] 作者: 徽章 時(shí)間: 2025-3-21 16:56
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering影響因子(影響力)
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering被引頻次
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering被引頻次學(xué)科排名
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering年度引用
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering年度引用學(xué)科排名
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering讀者反饋
書(shū)目名稱(chēng)Constraint-Based Design Recovery for Software Reengineering讀者反饋學(xué)科排名
作者: cartilage 時(shí)間: 2025-3-21 21:44 作者: 怒目而視 時(shí)間: 2025-3-22 02:07 作者: 危機(jī) 時(shí)間: 2025-3-22 06:02
Michael J. Clay Ph.D.,Jenna N. Albersngineering but is difficult to obtain due to the complexity of software, the specialized knowledge used to construct it, and the lack of existing understanding aids. As a result, there is a need for tools that can help programmers obtain this understanding. It is particularly crucial to have tools t作者: linear 時(shí)間: 2025-3-22 11:43
L. Jehel,R. Arnal,D. Carmelo,N. Howardts are the Concept Recognizer, DECODE, GRASPR, and Unprog. While they differ considerably in the details, they view the plan recognition problem as locating a set of items in the code that meet certain constraints, and they tend to to use heuristics to reduce the combinatorics involved in plan recog作者: 物種起源 時(shí)間: 2025-3-22 13:49 作者: 物種起源 時(shí)間: 2025-3-22 18:23
https://doi.org/10.1007/978-3-319-26282-6 algorithms tend to have different behavior in different problem domains, we have run a series of experiments to try to find a solving strategy whose performance is reasonable on small programs (those containing less than 1,500 lines of source code). We have then taken the best strategy and explored作者: Boycott 時(shí)間: 2025-3-23 00:32 作者: Palter 時(shí)間: 2025-3-23 03:16
Effect of Economic Crises on Suicide Ratescognition techniques to the program understanding problem. Curiously, however, program understanding researchers have not done so, and they have not explained why they have avoided the use of these plan recognition algorithms. The problem is that treating program understanding as plan recognition is作者: hazard 時(shí)間: 2025-3-23 09:30
Gustavo Zurita,José A Pino,Nelson Baloianrward use of MAP-CSP, and there is empirical evidence that MAP-CSP is an efficient mechanism for recognizing individual plans. Unfortunately, it is not clear that the Layered MAP-CSP approach scales with the size of the plan library, nor is it obvious how Layered MAP-CSP can be effectively extended 作者: Audiometry 時(shí)間: 2025-3-23 10:53
Pablo Curiel,Ivan Pretel,Ana B. Lagonderstanding and provided some initial evidence that this approach scales. However, there is additional experimental work to be done before moving our approach to program understanding out of the lab and into commercial practice. Despite its shortcomings, however, our work is an example both of the 作者: Constituent 時(shí)間: 2025-3-23 15:53
Constraint-Based Design Recovery for Software Reengineering978-1-4615-5461-5Series ISSN 1384-6469 作者: neutralize 時(shí)間: 2025-3-23 20:05 作者: 單純 時(shí)間: 2025-3-23 22:53 作者: Hearten 時(shí)間: 2025-3-24 03:24 作者: FOLD 時(shí)間: 2025-3-24 09:35
Introduction,ngineering but is difficult to obtain due to the complexity of software, the specialized knowledge used to construct it, and the lack of existing understanding aids. As a result, there is a need for tools that can help programmers obtain this understanding. It is particularly crucial to have tools t作者: synchronous 時(shí)間: 2025-3-24 12:28 作者: indices 時(shí)間: 2025-3-24 17:03
Program Understanding and Constraint Satisfaction,straint satisfaction problems (CSPs) to program understanding. One way to do so involves breaking program understanding into plan matching (finding all instances of a single plan in code) and plan ordering (determining an ordering for trying the plans in a plan library). Plan matching can be directl作者: 外科醫(yī)生 時(shí)間: 2025-3-24 21:59
Initial Experiments with Concept Recovery, algorithms tend to have different behavior in different problem domains, we have run a series of experiments to try to find a solving strategy whose performance is reasonable on small programs (those containing less than 1,500 lines of source code). We have then taken the best strategy and explored作者: FRET 時(shí)間: 2025-3-24 23:24
Additional Experiments with Concept Recovery,ollection of artificially generated programs, and they focused primarily on variants of FCDR, a particular, general-purpose constraint satisfaction approach. We now report on experiments with programs based on real-world C code. While not definitive, these new experiments support our earlier results作者: 無(wú)法破譯 時(shí)間: 2025-3-25 05:20 作者: 手銬 時(shí)間: 2025-3-25 07:53
Improving Our Constraint-Based Approach,rward use of MAP-CSP, and there is empirical evidence that MAP-CSP is an efficient mechanism for recognizing individual plans. Unfortunately, it is not clear that the Layered MAP-CSP approach scales with the size of the plan library, nor is it obvious how Layered MAP-CSP can be effectively extended 作者: 壓迫 時(shí)間: 2025-3-25 15:29 作者: MIR 時(shí)間: 2025-3-25 16:29
Introduction,rstanding aids. As a result, there is a need for tools that can help programmers obtain this understanding. It is particularly crucial to have tools that can extract design concepts. These tools can extract these design concepts using a pattern-based approach, with optional guidance from the user.作者: disparage 時(shí)間: 2025-3-25 22:58 作者: ARENA 時(shí)間: 2025-3-26 01:44
Additional Experiments with Concept Recovery,proach. We now report on experiments with programs based on real-world C code. While not definitive, these new experiments support our earlier results and have led to an improved constraint satisfaction algorithm that provides significant improvements in the scalability of our approach.作者: 浪費(fèi)時(shí)間 時(shí)間: 2025-3-26 05:46
Conclusions, approach to program understanding out of the lab and into commercial practice. Despite its shortcomings, however, our work is an example both of the power of constraint satisfaction techniques and of the experimental approach in software engineering research.作者: formula 時(shí)間: 2025-3-26 09:58
https://doi.org/10.1007/978-3-319-26282-6 its performance to see how it scales to larger programs and larger plans, and how its performance is affected by different component distributions. Along the way, we have compared MAP-CSP to a constraint-based implementation of an existing program understanding algorithm.作者: 放逐 時(shí)間: 2025-3-26 15:10 作者: 油氈 時(shí)間: 2025-3-26 18:50
1384-6469 escribes our research effort in attacking this problem. It discusses our theory of how a constraint-based approach to program plan recognition can efficiently extract design concepts from source code, and it details experiments in concept recovery that support our claims of scalability. Importantly,作者: 大溝 時(shí)間: 2025-3-26 23:07
Michael J. Clay Ph.D.,Jenna N. Albersrstanding aids. As a result, there is a need for tools that can help programmers obtain this understanding. It is particularly crucial to have tools that can extract design concepts. These tools can extract these design concepts using a pattern-based approach, with optional guidance from the user.作者: 摘要 時(shí)間: 2025-3-27 03:03
L. Jehel,R. Arnal,D. Carmelo,N. Howardcating a set of items in the code that meet certain constraints, and they tend to to use heuristics to reduce the combinatorics involved in plan recognition. None of these efforts has resulted in a general plan recognition algorithm that scales to the size of real-world software systems.作者: 鳥(niǎo)籠 時(shí)間: 2025-3-27 05:37
Suicidal Crisis in the Digital Ageproach. We now report on experiments with programs based on real-world C code. While not definitive, these new experiments support our earlier results and have led to an improved constraint satisfaction algorithm that provides significant improvements in the scalability of our approach.作者: Amnesty 時(shí)間: 2025-3-27 12:20 作者: condescend 時(shí)間: 2025-3-27 16:06 作者: sperse 時(shí)間: 2025-3-27 17:56
Initial Experiments with Concept Recovery, its performance to see how it scales to larger programs and larger plans, and how its performance is affected by different component distributions. Along the way, we have compared MAP-CSP to a constraint-based implementation of an existing program understanding algorithm.作者: 強(qiáng)行引入 時(shí)間: 2025-3-28 01:20 作者: abstemious 時(shí)間: 2025-3-28 03:22
Effect of Economic Crises on Suicide Rates). This CSP framework has the benefit not only of being formal and well-understood, but it is also sufficient to capture the behavior of several existing algorithms, allowing their behavior to be compared effectively.作者: acclimate 時(shí)間: 2025-3-28 09:11 作者: 食草 時(shí)間: 2025-3-28 11:31
Program Understanding and Constraint Satisfaction,). This CSP framework has the benefit not only of being formal and well-understood, but it is also sufficient to capture the behavior of several existing algorithms, allowing their behavior to be compared effectively.作者: grovel 時(shí)間: 2025-3-28 15:06
Program Understanding and AI Plan Recognition,nding task differs significantly from the typical general plan recognition task along several key dimensions, and these differences are what make it particularly amenable to constraint satisfaction techniques.作者: 樂(lè)器演奏者 時(shí)間: 2025-3-28 22:46
Book 2024Latest editionectations and dire warnings of ‘robot overlords’. Any business executive who wants to know how to exploit AI in their business today is left confused and frustrated...As an advisor in AI, Andrew Burgess regularly comes face–to–face with business executives who are struggling to cut through the AI an作者: Peak-Bone-Mass 時(shí)間: 2025-3-29 02:37
Schleifen,hoher Festigkeit, insbesondere Stahl. Für Stahl gilt allgemein die Faustregel: Die H?rte der Scheibe steht im umgekehrten Verh?ltnis zur Festigkeit oder H?rte des Werkstoffes. Für Nichteisenmetalle, wie Kupfer und Aluminium, die leicht zum Schmieren neigen, verwendet man dagegen weichere por?se Siliziumkarbidscheiben.作者: visual-cortex 時(shí)間: 2025-3-29 04:17 作者: GRAIN 時(shí)間: 2025-3-29 10:02
