메뉴 건너뛰기





Volumn , Issue , 2000, Pages 86-92

On the approximability of trade-offs and optimal access of web sources

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PARETO PRINCIPLE; POLYNOMIALS; WORLD WIDE WEB;

EID: 0034503926     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (420)

References (11)
  • Reference 정보가 존재하지 않습니다.

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