http:^^www.cs.indiana.edu^research^pwp^description.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 39 行

HTML
39 行
字号 
Date: Wed, 20 Nov 1996 19:14:34 GMT
Server: Apache/1.0.3
Content-type: text/html
Content-length: 2074
Last-modified: Mon, 04 Dec 1995 19:16:46 GMT

<html><HEAD><Title>Theory</Title></Head><Body><h2>Constraint Statisfaction</h2><Strong>Description:</Strong><Blockquote>This research is concerned with finding fast algorithms for constraint satisfaction problems.  A constraint satisfaction problem is one in which a series of constraints is imposed on a set of discrete variables.  The task is to find a set of values for all the variables that satisfies all the constraints simultaneously.  For example, when scheduling traffic lights, each light may be in one of only three discrete states.  Furthermore, there are constraints on the states of the traffic lights that require that no two cross-streets get green lights at the same time.  A constraint satisfaction problem may have thousands of variables and thousands of constraints.<P>Constraint satisfaction problems arise in diverse areas.  These include generating tests of correctness for electronic circuits, understanding line drawings by computer, solving combinatorial problems, and predicting the folding of RNA molecules.  The set of constraint satisfaction problems is one of the NP complete problem sets, so it is unlikely that a fast algorithm for all constraint satisfaction problems will ever be found.  Indeed, brute force algorithms for constraint satisfaction problems may be extremely slow.  Nonetheless, algorithms have been found that are fast for most problems in certain NP complete problem sets.  This research is concerned with finding and characterizing the algorithms and problem sets for which constraint satisfaction problems can be solved quickly, with the aim of finding general algorithms that are fast over as wide a range of problem sets as possible.</blockquote><p><strong>Associated Faculty:</strong><ul><li><!WA0><a href="http://www.cs.indiana.edu/research/pwp/www.cs.indiana.edu/hypan/pwp.html">Paul Walton Purdom Jr.</a></ul><p><strong>Associated Graduate Students:</strong>Dmitri Gusev and Neil Haven<p><strong>Support:</strong>NSF<p><!WA1><a href="http://www.cs.indiana.edu/l/www/research/index.html"><!WA2><IMG SRC="http://www.cs.indiana.edu/research/back.gif">Return to Computer Science Research Page</a>

http:^^www.cs.indiana.edu^research^pwp^description.html - 源码说明

本页面展示了「This data set contains WWW-pages collected from computer science departments of various universities」中的 http:^^www.cs.indiana.edu^research^pwp^description.html 源码文件，采用 HTML 编程语言编写，共 39 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与universities相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?