Entry Karimi:2000:IMA from lncs2000.bib
Last update: Thu May 16 02:07:42 MDT 2019
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Karimi:2000:IMA,
author = "Kamran Karimi",
title = "The Iterative Multi-agent Method for Solving Complex
Search Problems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1822",
pages = "369--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:34 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t.htm;
http://www.math.utah.edu/pub/tex/bib/lncs2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1822/18220369.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1822/18220369.pdf",
acknowledgement = ack-nhfb,
}
Related entries
- agent, Multi-,
1755(0)503,
1792(0)297,
1792(0)309,
1822(0)187,
1822(0)389,
1839(0)83,
1909(0)314,
1919(0)254,
1919(0)300,
1931(0)243,
1932(0)237,
1932(0)591,
1937(0)449,
1983(0)301,
1983(0)314,
1983(0)320,
1983(0)338
- Complex,
1731(0)323,
1773(0)150,
1800(0)784,
1839(0)654,
1839(0)668,
1883(0)69,
1910(0)558,
1932(0)543
- Iterative,
1937(0)217
- Karimi, Kamran,
1932(0)266,
1983(0)85
- Method,
1755(0)396,
1782(0)104,
1783(0)82,
1783(0)334,
1800(0)974,
1800(0)977,
1800(0)985,
1816(0)2,
1816(0)9,
1816(0)73,
1818(0)138,
1822(0)254,
1825(0)282,
1825(0)367,
1825(0)445,
1835(0)204,
1835(0)233,
1857(0)1,
1857(0)127,
1857(0)137,
1857(0)230,
1861(0)373,
1861(0)553,
1864(0)313,
1878(0)95,
1878(0)363,
1878(0)374,
1878(0)491,
1883(0)20,
1883(0)267,
1883(0)278,
1892(0)289,
1902(0)357,
1908(0)80,
1910(0)211,
1915(0)143,
1932(0)148,
1932(0)176,
1932(0)534,
1932(0)619,
1933(0)67,
1933(0)111,
1933(0)212,
1933(0)274,
1934(0)30,
1937(0)172,
1940(0)471,
1941(0)219,
1954(0)505,
1955(0)417,
1975(0)179,
1976(0)359,
1983(0)215,
1983(0)479
- Multi-agent,
1755(0)503,
1792(0)297,
1792(0)309,
1822(0)187,
1822(0)389,
1839(0)83,
1909(0)314,
1919(0)254,
1919(0)300,
1931(0)243,
1932(0)237,
1932(0)591,
1937(0)449,
1983(0)301,
1983(0)314,
1983(0)320,
1983(0)338
- Search,
1759(0)127,
1765(0)364,
1770(0)466,
1770(0)529,
1777(0)21,
1792(0)107,
1792(0)380,
1800(0)660,
1822(0)1,
1822(0)240,
1834(0)185,
1851(0)549,
1853(0)236,
1861(0)254,
1866(0)165,
1880(0)359,
1892(0)319,
1902(0)39,
1908(0)88,
1909(0)117,
1923(0)69,
1923(0)83,
1923(0)389,
1928(0)161,
1983(0)404,
1983(0)559,
2125(0)414,
2125(0)471
- Solving,
1753(0)200,
1753(0)293,
1754(0)124,
1755(0)93,
1755(0)424,
1767(0)277,
1770(0)290,
1792(0)72,
1792(0)380,
1800(0)314,
1800(0)423,
1800(0)595,
1807(0)19,
1807(0)392,
1839(0)33,
1839(0)133,
1839(0)232,
1839(0)393,
1839(0)403,
1849(0)239,
1861(0)747,
1866(0)147,
1923(0)389,
1932(0)237,
1955(0)225,
1955(0)399,
1955(0)451