國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms and ordering heuristics f...

Wahbi, Mohamed.

Algorithms and ordering heuristics for distributed constraint satisfaction problems

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms and ordering heuristics for distributed constraint satisfaction problemsMohamed Wahbi.
作者:	Wahbi, Mohamed.
出版者:	London :ISTE ;2013.
面頁冊數:	1 online resource (xvi, 157 p.)
標題:	Computer algorithms.
電子資源:	http://onlinelibrary.wiley.com/book/10.1002/9781118753620

Algorithms and ordering heuristics for distributed constraint satisfaction problems
Wahbi, Mohamed.

Algorithms and ordering heuristics for distributed constraint satisfaction problems[electronic resource] /Mohamed Wahbi. - London :ISTE ;2013. - 1 online resource (xvi, 157 p.) - FOCUS Series. - FOCUS Series..

DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm. However, there are several applications in multi-agent coordination that are of a distributed nature. In this type of application, the knowledge about the problem, that is, variables and constraints, may be logically or geographically distributed among physical distributed agents.Subjects--Topical Terms:

184478
Computer algorithms.

LC Class. No.: TA1637

Dewey Class. No.: 621.36

Algorithms and ordering heuristics for distributed constraint satisfaction problems
LDR:01478cmm a2200265Ia 4500 001 467420
006 m o d
007 cr |||||||||||
008 160107s2013 enk o 000 0 eng d
020 $z 9781848215948
020 $z 1848215940
020 $a 9781118753620 (electronic bk.)
020 $a 1118753623 (electronic bk.)
020 $a 9781118753521 (electronic bk.)
020 $a 1118753526 (electronic bk.)
035 $a ocn852758626
040 $a EBLCP $b eng $c EBLCP $d IDEBK $d CUS $d N $d OCLCA $d E7B
050 4 $a TA1637
082 0 4 $a 621.36
100 1 $a Wahbi, Mohamed. $3 722310
245 1 0 $a Algorithms and ordering heuristics for distributed constraint satisfaction problems $h [electronic resource] / $c Mohamed Wahbi.
260 $a London : $b ISTE ; $a Hoboken : $b Wiley, $c 2013.
300 $a 1 online resource (xvi, 157 p.)
490 1 $a FOCUS Series
520 $a DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm. However, there are several applications in multi-agent coordination that are of a distributed nature. In this type of application, the knowledge about the problem, that is, variables and constraints, may be logically or geographically distributed among physical distributed agents.
588 $a Description based on print version record.
650 0 $a Computer algorithms. $3 184478
650 0 $a Image processing $x Digital techniques. $3 182119
650 0 $a Neural computers. $3 203673
830 0 $a FOCUS Series. $3 721525
856 4 0 $u http://onlinelibrary.wiley.com/book/10.1002/9781118753620