메뉴 건너뛰기




Volumn 3, Issue , 2008, Pages 1797-1804

Cooperative search for optimizing pipeline operations

Author keywords

Cooperative search; Optimization; Pipeline operations

Indexed keywords

AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS; OPTIMIZATION;

EID: 84899905198     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (15)
  • 1
    • 85027514443 scopus 로고
    • Parallel Grant: Optimization of evolutionary algorithms
    • LNCS
    • T. Bäck: Parallel Optimization of Evolutionary Algorithms, Proc. Parallel Problem Solving from Nature III, LNCS, 1994, pp. 418-427.
    • (1994) Proc Parallel Problem Solving from Nature III , pp. 418-427
    • Bäck, T.1
  • 4
    • 0002885164 scopus 로고
    • Knowledge-based distributed search using teamwork
    • San Francisco
    • J. Denzinger: Knowledge-Based Distributed Search Using Teamwork, Proc. lst ICMAS, San Francisco, 1995, pp. 81-88.
    • (1995) st ICMAS , pp. 81-88
    • Denzinger, J.1
  • 5
    • 26944468056 scopus 로고    scopus 로고
    • Conflict handling in collaborative search
    • in Tessier, Chaudron, Müller (eds.), Kluwer
    • J. Denzinger: Conflict Handling in Collaborative Search, in Tessier, Chaudron, Müller (eds.): Conflicting Agents: Conflict management in multi-agent systems, Kluwer, 2000, pp. 251-278.
    • (2000) Conflicting Agents: Conflict Management in Multi-agent Systems , pp. 251-278
    • Denzinger, J.1
  • 6
    • 84880692234 scopus 로고    scopus 로고
    • Cooperation of heterogeneous provers
    • Stockholm, Morgan Kaufmann
    • J. Denzinger and D. Fuchs: Cooperation of Heterogeneous Provers, Proc. IJCAI-99, Stockholm, Morgan Kaufmann, 1999, pp. 10-15.
    • (1999) Proc IJCAI-99 , pp. 10-15
    • Denzinger, J.1    Fuchs, D.2
  • 7
    • 84901419531 scopus 로고    scopus 로고
    • On cooperation between evolutionary algorithms and other search paradigms
    • Washington, IEEE -Press
    • J. Denzinger and T. Offermann: On Cooperation between Evolutionary Algorithms and other Search Paradigms, Proc. CEC-99, Washington, IEEE-Press, 1999, pp. 2317-2324.
    • (1999) Proc. CEC-99 , pp. 2317-2324
    • Denzinger, J.1    Offermann, T.2
  • 8
    • 84930794795 scopus 로고    scopus 로고
    • Solving traveling salesman problems using a parallel synchronized branch and bound algorithm
    • CG. Diderich and M. Gengler: Solving Traveling Salesman Problems Using a Parallel Synchronized Branch and Bound Algorithm, Proc. High-Performance Computing and Networking, Brüssel, 1996, pp. 633-638.
    • (1996) Proc High-Performance Computing and Networking, Brüssel , pp. 633-638
    • Diderich, C.G.1    Gengler, M.2
  • 9
    • 84899897157 scopus 로고    scopus 로고
    • Pipeline design & construction: A practical approach
    • M. Mohitpour, H. Golshan and A. Murray: Pipeline Design & Construction: A Practical Approach, ASME, 2003.
    • (2003) ASME
    • Mohitpour, M.1    Golshan, H.2    Murray, A.3
  • 10
    • 0025403749 scopus 로고
    • Analysis and implementation of branch-and-bound algorithms on hypercube multi-computers
    • M.J. Quinn: Analysis and Implementation of Branch-and-Bound Algorithms on Hypercube MultiComputers, IEEE Trans. Computation, Vol 39(3), 1990, pp. 384-387.
    • (1990) IEEE Trans. Computation , vol.39 , Issue.3 , pp. 384-387
    • Quinn, M.J.1
  • 12


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.