메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 673-675

Learning to identify winning coalitions in the PAC model

Author keywords

Coalition formation; PAC learning

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINED OPTIMIZATION; DATA STRUCTURES; THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 34247192566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160751     Document Type: Conference Paper
Times cited : (6)

References (4)
  • 1
    • 34250091945 scopus 로고
    • Learning quickly when irrelevant attributes abound
    • N. Littlestone. Learning quickly when irrelevant attributes abound. Machine Learning, 2(4):285-318, 1988.
    • (1988) Machine Learning , vol.2 , Issue.4 , pp. 285-318
    • Littlestone, N.1
  • 3
    • 13844298256 scopus 로고    scopus 로고
    • On the capabilities of higher-order neurons: A radial basis function approach
    • M. Schmitt. On the capabilities of higher-order neurons: A radial basis function approach. Neural Computation, 17(3):715-729, 2005.
    • (2005) Neural Computation , vol.17 , Issue.3 , pp. 715-729
    • Schmitt, M.1


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