Back to Results
First PageMeta Content
Artificial intelligence / Constraint satisfaction / Search algorithm / Hybrid algorithm / Algorithm / Backjumping / Parallel computing / Backtracking / Distributed algorithm / Constraint programming / Computer programming / Software engineering


Comparison of Different Approaches for Solving Distributed Constraint Satisfaction Problems
Add to Reading List

Document Date: 2006-01-11 04:22:21

Open Document

File Size: 835,80 KB

Share Result on Facebook

City

Barcelona / Varlable / Toronto / Glasgow / /

Company

BT / Protocols John Wiley and Sons / /

Country

Japan / Scotland / Spain / /

Currency

pence / /

Facility

University of Strathclyde / Computer Science University of Strathclyde / /

IndustryTerm

search processes / Domain-based algorithms / domain-based search strategy / search process / infinite processing loops / search space type / resultant search space / separated search space / spare processors / distributed search algorithms / search spaces / variables other processors / logical links amongdifferent search spaces / distributed computing / search information / unnecessary search paths / nogood anmngdifferent processors / sequential algorithms / search tasks / hybrid algorithms / ill variable-based algorithms / infinite processing loop / search algorithms / search heuristic methods / larger search spaces / above algorithms / shared search space / search activity / problem algorithm / negotiation algorithm / search rearrangement methodof / parallel computing power / large multiprocessor networks / search state / sub search spaces / sub-search space / software processes / search space using several processors / heuristic search strategies / sequential search algorithms / sequential search algorithm / sequential algorithm / Termination detection algorithms / search tree / Variable-based algorithms / search space / distributed search algorithm / /

OperatingSystem

SEQUENT / /

Organization

Computer Science University / Institute for NewGeneration Computer Technology / Biennial Conference Canadian Society for Computational Studies / Luo P. G. Hendry J. T. Buchanan Department / U.K. Science and Engineering Research Council / International Joint Conferenceon Artificial Intelligence / University of Strathclyde / Constraint Satisfaction ProblemsArtificial Intelligence / /

Person

Backtracking Algorithm / Checking Parts / Patrick Prosser Hybrid Algorithms / Jeffrey S. Rosenschein / Bernard Burg Parallel Forward Checking / Rina Dechter Learning / Rina Dechter Constraint / /

Position

General / straight-forward / Burg Parallel Forward / /

ProgrammingLanguage

C / /

Technology

sequential search algorithm / 3.3 Function-based Algorithms / above algorithms / sequential algorithms / domain-based algorithms / sequential search algorithms / 3 3.1 THE ALGORITHMS Variable-based Algorithms / distributed search algorithms / ill variable-based algorithms / base algorithm / Whena processor / search algorithms / two processors / previous algorithms / negotiation algorithm / 2 Comparison Algorithms / hybrid algorithms / Termination detection algorithms / shared memory / distributed search algorithm / sequential algorithm / one processor / distributed algorithm / spare processors / machine vision / load balancing / artificial intelligence / 156 sharing nogood anmngdifferent processors / then spare processors / problem algorithm / Variable-based algorithms / same algorithm / Basic DPS Strategies Varlable-based Domain-based algorithms / 3.2 Domain-based Algorithms / /

URL

www.aaai.org / /

SocialTag