Academia.eduAcademia.edu

Figure 1 – uploaded by Redha Taguelmimt

See full PDFdownloadDownload figure
Figure 1: A four-agent example of the IP graph. ~ Lunis, Lyon 1 University, France > Laboratory of Applied Mathematics, Faculty of Exact Sciences, University of Bejaia, 06000 Bejaia, Algeria 3 National Institute of Technology Durgapur, India redha.taguelmimt@ gmail.com, samir.aknine @ univ-lyon1.fr, boukredera@ hotmail.com, narayan.changder @ gmail.co:

Figure 1 A four-agent example of the IP graph. ~ Lunis, Lyon 1 University, France > Laboratory of Applied Mathematics, Faculty of Exact Sciences, University of Bejaia, 06000 Bejaia, Algeria 3 National Institute of Technology Durgapur, India redha.taguelmimt@ gmail.com, samir.aknine @ univ-lyon1.fr, boukredera@ hotmail.com, narayan.changder @ gmail.co:

Related Figures (1)

Figure 2: The first figures a, b, c depict the time performance in seconds of FACS, ODP-IP and CSG-UCT for a number of agents between 20 and 26. The figures d, e, f depict the time taken to produce a certain solution quality by FACS and CSG-UCT for 30 agents. Here, solution quality is calcu- v(CS) max(v(CS#aos)0(CSasq_ucr)) , where v(CS) is the current best solution of the algorithm. lated by using the formula:
Figure 2: The first figures a, b, c depict the time performance in seconds of FACS, ODP-IP and CSG-UCT for a number of agents between 20 and 26. The figures d, e, f depict the time taken to produce a certain solution quality by FACS and CSG-UCT for 30 agents. Here, solution quality is calcu- v(CS) max(v(CS#aos)0(CSasq_ucr)) , where v(CS) is the current best solution of the algorithm. lated by using the formula:
Related topics:
Computer Science
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved