Works Published in 2002
Displaying works 21 - 40 of 103 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2002 chapter
Performance Analysis of LEO Satellite Networks
In E. Gregori, M. Conti, A. T. Campbell, G. Omidyar, & M. Zukerman (Eds.), NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications (pp. 790–801).
Ed(s): E. Gregori, M. Conti, A. Campbell, G. Omidyar & M. Zukerman
TL;DR:
An analytical model for computing call blocking probabilities in a LEO satellite network that carries voice calls is presented, and it is demonstrated that the method is accurate for a wide range of traffic patterns.
(via Semantic Scholar)
link.springer.com (publisher PDF)
Sources: Crossref, ORCID
Added: August 28, 2020
2002 conference paper
LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA
Mathematical Software. Presented at the Proceedings of the First International Congress of Mathematical Software.
Event: Proceedings of the First International Congress of Mathematical Software
TL;DR:
The design of this generic library LinBox is described, its current range of capabilities are sketched, its guiding design principle of re-usability is given, and several examples of its use are given.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2002 conference paper
An output-sensitive variant of the baby steps/giant steps determinant algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation - ISSAC '02. Presented at the the 2002 international symposium.
Event: the 2002 international symposium
TL;DR:
An algorithm in [15], which in turn is based on one by [31] and which uses the baby steps/giant steps algorithm design technique, can be adapted to the dense integer matrix determinant problem and then has bit complexity.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2002 journal article
The ρ operator
ACM SIGMOD Record.
TL;DR:
An approach that supports querying for Semantic Associations on the Semantic Web has four main facets, and uses a graph data model for knowledge representation, allowing the semantic associations search techniques to be built upon the graph algorithms for paths, while integrating knowledge from the schema into the search process.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
2002 journal article
Working the flow
IEEE Internet Computing. https://publons.com/publon/21294503/
Contributors: M. Singh
Source: ORCID
Added: December 10, 2019
2002 journal article
Who you gonna call?
IEEE Internet Computing.
Contributors: J. Willis, C. Hinds, B. Ballard, A. Newland & M. Singh
Source: ORCID
Added: December 10, 2019
2002 journal article
Treating health care
IEEE Internet Computing. https://publons.com/publon/21294506/
Contributors: M. Singh
Source: ORCID
Added: December 10, 2019
2002 journal article
The pragmatic Web
IEEE Internet Computing.
Contributors: K. VanderLinden*, N. Colineau* & C. Paris *
TL;DR:
This paper presents a prototype system that produces web presentations describing the programs offered by a public administration agency to the citizenry it serves and particular attention is focused on the system's authoring tool, which allows authors to produce and configure the resources required to drive the tailoring mechanism.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: ORCID
Added: December 10, 2019
2002 journal article
Who you gonna call?
IEEE Internet Computing, 6(6), 4–5. http://www.scopus.com/inward/record.url?eid=2-s2.0-0036870154&partnerID=MN8TOARS
Contributors: M. Singh
Source: ORCID
Added: December 10, 2019
2002 journal article
TL;DR:
Network technologies show great promise in solving some of the dangerous and tragic "avoidable medical errors" that currently plague the health care industry.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2002 journal article
TL;DR:
It is claimed that successful approaches to creating the Semantic Web lie within the scope of pragmatics, which provides meaning only to the extent that it can be capturedstatically.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2002 journal article
Deep Web structure
IEEE Internet Computing. https://publons.com/publon/21294508/
Contributors: M. Singh
Source: ORCID
Added: December 10, 2019
2002 chapter
Commitment Machines
In Lecture Notes in Computer Science (pp. 235–247).
Contributors: M. Singh n & P. Yolum n
TL;DR:
It is shown how a commitment machine can be compiled into a finite state machine for efficient execution, and soundness and completeness of the compilation procedure are proved.
(via Semantic Scholar)
Sources: ORCID, Crossref
Added: December 10, 2019
2002 conference paper
Flexible protocol specification and execution: Applying event calculus planning using commitments
Proceedings of the International Conference on Autonomous Agents, (1), 527–534. http://www.scopus.com/inward/record.url?eid=2-s2.0-0036361523&partnerID=MN8TOARS
Contributors: P. Yolum & M. Singh
Source: ORCID
Added: December 10, 2019
2002 journal article
Distributed reputation management for electronic commerce
Computational Intelligence, 18(4), 535–549. http://www.scopus.com/inward/record.url?eid=2-s2.0-0036862099&partnerID=MN8TOARS
Contributors: B. Yu & M. Singh
Source: ORCID
Added: December 10, 2019
2002 book
Commitment machines
In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 235–247). http://www.scopus.com/inward/record.url?eid=2-s2.0-84901701271&partnerID=MN8TOARS
Contributors: P. Yolum & M. Singh
Source: ORCID
Added: December 10, 2019
2002 conference paper
An evidential model of distributed reputation management
Proceedings of the International Conference on Autonomous Agents, (2), 294–301. http://www.scopus.com/inward/record.url?eid=2-s2.0-0036362188&partnerID=MN8TOARS
Contributors: B. Yu & M. Singh
Source: ORCID
Added: December 10, 2019
2002 conference paper
An agent-based approach to knowledge management
International Conference on Information and Knowledge Management, Proceedings, 642–644. http://www.scopus.com/inward/record.url?eid=2-s2.0-0037480812&partnerID=MN8TOARS
Contributors: B. Yu & M. Singh
Source: ORCID
Added: December 10, 2019
2002 conference paper
Efficient utility functions for ceteris paribus preferences
Proceedings of the National Conference on Artificial Intelligence, 279–284. http://www.scopus.com/inward/record.url?eid=2-s2.0-0036926279&partnerID=MN8TOARS
Contributors: M. McGeachie & J. Doyle
Source: ORCID
Added: December 6, 2019
2002 conference paper
The role of a skeptic agent in testing and benchmarking of SAT algorithms
Fifth International Symposium on theTheory and Applications of Satisfiability Testing. Presented at the Citeseer.
Event: Citeseer
Source: ORCID
Added: December 6, 2019
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
