Back to Results
First PageMeta Content
Virtual Processor / Speedup / Multi-core processor / Distributed computing / Parallel algorithm / Scheduling / Binary tree / Scalability / A* search algorithm / Concurrent computing / Computing / Parallel computing


An Adaptive Framework for Large-scale State Space Search Yanhua Sun, Gengbin Zheng, Pritish Jetley, Laxmikant V. Kal´e Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801, USA {sun
Add to Reading List

Document Date: 2011-05-01 22:30:33


Open Document

File Size: 619,26 KB

Share Result on Facebook

City

New York / Newport Beach / Ullapool / St. Charles / London / /

Company

Argonne National Laboratory / C HARM / Computer Sciences / IEEE Software / Ed. ACM Press / /

Country

United States / United Kingdom / Scotland / /

Currency

pence / /

/

Facility

University of Illinois / Computer Science University of Illinois / /

IndustryTerm

local depthfirst search / parallel search contexts / parallel search application / search engine framework general / space search / search process / tree search / heuristic-guided first-solution search / parallel algorithms / parallel search procedure / space search applications / search target / regular graph search / space search problems / processors search / namely startup / search procedure / branch-and-bound search problem / search frontier / multi-core chips / load balancing algorithms / parallel state-space search / parallel search techniques / allsolutions search / search problem / parallel processing / namely all-solution / parallel combinatorial search / state-space search / multiprocessor systems / parallel state space search applications / parallel infrastructure / bidirectional search algorithms / state space search applications / parallel branch-and-bound algorithms / all-solutions / maximum search depth / or-parallel exhaustive search programs / state space search problem / real-world applications / recipient processor / unbalanced search tree / unbalanced tree search benchmark / parallel symbolic computing / polynomial-time algorithms / well known applications / search state / parallel search / depth-first search / heuristic algorithms / state space search problems / state space search technique / sequential search / loaded processor / search techniques / static parallel search depth threshold / game-tree search / search tree / straightforward solution / parallel search methods / state space search / search engine framework / search space / unbalanced tree search / parallel search program / search engine / genetic search / search depth / physical processors / state space search process / /

Organization

National Institute of Health / National Science Foundation / University of Illinois / Institute for Advanced Computing Applications and Technologies / /

Person

V. N. Rao / V / B. Ramkumar / V / PACE S EARCH / /

Position

programmer / so that it has wide applicability / Queen / salesman / scheduler / programmer / /

ProgrammingLanguage

Cilk / C++ / /

ProvinceOrState

Illinois / /

PublishedMedium

IEEE Software / Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

Functional Programming / 1 / 024 processors / parallel branch-and-bound algorithms / polynomial-time algorithms / creating processor / 1024 processors / search engine / Unidirectional and bidirectional search algorithms / Parallel algorithms / 8 / 192 processors / load balancing algorithms / one processor / ONCLUSION processors / 16 / 384 processors / load balancing / artificial intelligence / lightly loaded processor / 512 processors / recipient processor / parallel processing / /

URL

http /

SocialTag