Works Published in 2007
Displaying works 61 - 80 of 140 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2007 conference paper
Engineering foreign exchange processes via commitment protocols
Proceedings - 2007 IEEE International Conference on Services Computing, SCC 2007, 514–521.
Contributors: N. Desai n, A. Chopra n, M. Arrott*, B. Spechte & M. Singh n
TL;DR:
This paper validates a formal, protocol-based approach by specifying foreign exchange processes as standardized by the TWIST consortium by formalizing a small, core set of foreign exchange interaction protocols on which the desired processes can be based.
(via Semantic Scholar)
citeseerx.ist.psu.edu (repository)
Source: ORCID
Added: December 10, 2019
2007 journal article
Logic-Based Agent Verification
Journal of Applied Logic, 5(2), 193–195.
Contributors: M. Fisher *, M. Singh n , D. Spears* & M. Wooldridge *
TL;DR:
This special issue of the Journal of Applied Logic contains six papers on state-of-the-art research on the topic of assuring the trustworthiness of multi-agent systems, and a new multiagent system (MAS) protocol language for multi- agent dialogues that is based on process calculus.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2007 conference paper
InterPol: A policy framework for managing trust and privacy in referral networks
Proceedings of the International Conference on Autonomous Agents, 1095–1097.
Contributors: Y. Udupi n & M. Singh n
TL;DR:
A general referrals-based framework for privacy and trust management is shown to effectively capture a variety of privacy and Trust requirements of autonomous users.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2007 conference paper
An event-driven approach for agent-based business process enactment
Proceedings of the International Conference on Autonomous Agents, 1269–1271.
Contributors: P. Chakravarty n & M. Singh n
TL;DR:
An event-driven architecture that enriches multiagent models with events resulting in a more robust and proactive system is proposed in a business process framework based on protocols and policies, where agents' behaviors are specified via rules.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2007 conference paper
A modular action description language for protocol composition
Proceedings of the National Conference on Artificial Intelligence, 2, 962–967. http://www.scopus.com/inward/record.url?eid=2-s2.0-36349036553&partnerID=MN8TOARS
Contributors: N. Desai & M. Singh
Source: ORCID
Added: December 10, 2019
2007 conference paper
Enacting protocols by commitment concession
Proceedings of the International Conference on Autonomous Agents, 116–123.
Contributors: P. Yolum * & M. Singh n
TL;DR:
This paper formulates inference rules for commitment concession that respect the nature of commitments, and demonstrates how such rules can be applied in practice, and identifies conditions under which progress and termination of protocol enactment can be guaranteed.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2007 conference paper
Dynamics of contracts-based organizations: A formal approach based on institutions
Proceedings of the International Conference on Autonomous Agents, 82–84.
Contributors: Y. Udupi n & M. Singh n
TL;DR:
The proposed approach places organizations within institutions, themselves modeled as specialized organizations, and establishes some important dynamic aspects by providing a commitment life cycle analysis.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2007 conference paper
Choice and interoperation in protocol enactment
Proceedings of the International Conference on Autonomous Agents, 132–134.
Contributors: A. Chopra n & M. Singh n
TL;DR:
The objective of this paper is to study the conceptual underpinnings of protocol enactment in multiagent systems and characterize the operationalization of agents so as to determine whether and when agents may be interoperable.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2007 conference paper
Interest-matching comparisons using CP-nets
Proceedings of the National Conference on Artificial Intelligence, 2, 1914–1915. http://www.scopus.com/inward/record.url?eid=2-s2.0-36348991910&partnerID=MN8TOARS
Contributors: A. Wicker & J. Doyle
Source: ORCID
Added: December 6, 2019
2007 journal article
AAAI-07 workshop reports
AI Magazine, 28(4), 119–128. http://www.scopus.com/inward/record.url?eid=2-s2.0-39049150323&partnerID=MN8TOARS
Contributors: S. Anand, D. Bahls, C. Burghart, M. Burstein, H. Chen, J. Collins, T. Dietterich, J. Doyle
Source: ORCID
Added: December 6, 2019
2007 conference paper
AAAI Workshop - Technical Report: Preface
AAAI Workshop - Technical Report, WS-07-10. http://www.scopus.com/inward/record.url?eid=2-s2.0-51849090045&partnerID=MN8TOARS
Contributors: J. Doyle , J. Goldsmith, U. Junker & J. Lang
Source: ORCID
Added: December 6, 2019
2007 report
View and index selection for query-performance improvement: Algorithms, heuristics and complexity
North Carolina State University. Dept. of Computer Science.
Source: ORCID
Added: December 6, 2019
2007 conference paper
Proofchecker: an accessible environment for automata theory correctness proofs
ACM SIGCSE Bulletin, 39(3), 48–52.
Event: ACM
Source: ORCID
Added: December 6, 2019
2007 conference paper
High-contrast algorithm behavior: observation, hypothesis, and experimental design
Proceedings of the 2007 workshop on Experimental computer science, 12.
Event: ACM
Source: ORCID
Added: December 6, 2019
2007 journal article
A case for smaller class size with integrated lab for introductory computer science
ACM SIGCSE Bulletin, 39(1), 341–345.
Source: ORCID
Added: December 6, 2019
2007 journal article
Irreducible polynomials and barker sequences
ACM Communications in Computer Algebra, 41(4), 118.
TL;DR:
It is shown that in this case the problem can in fact be reduced to a question of irreducibility for a certain family of univariate polynomials, and it is proved that the polynmials in question are always reducible modulo <i>p</i>, for every prime.
(via Semantic Scholar)
Source: Crossref
Added: August 18, 2019
2007 chapter
Structured Low Rank Approximation of a Sylvester Matrix
In Trends in Mathematics (pp. 69–83).
author keywords: Sylvester matrix; approximate greatest common divisor; structured total least norm; hybrid symbolic/numeric algorithm
TL;DR:
This work presents iterative algorithms that compute an approximate GCD and that can certify an approximate ∈-GCD when a tolerance ∈ is given on input and demonstrates the practical performance of these algorithms on a diverse set of univariate pairs of polynomials.
(via Semantic Scholar)
Source: Crossref
Added: August 18, 2019
2007 conference paper
Using independent-study projects in your research and teaching program
Proceedings of the 2007 ASEE Annual Conference and Exposition. Presented at the 2007 ASEE Annual Conference and Exposition, Honolulu, HI.
Event: 2007 ASEE Annual Conference and Exposition at Honolulu, HI on June 24-27, 2007
Sources: NC State University Libraries, ORCID
Added: June 12, 2019
2007 conference paper
Active and collaborative learning strategies for teaching computing
Proceedings of the 2007 ASEE Annual Conference and Exposition. Presented at the 2007 ASEE Annual Conference and Exposition, Honolulu, HI.
Event: 2007 ASEE Annual Conference and Exposition at Honolulu, HI on June 24-27, 2007
Sources: NC State University Libraries, ORCID
Added: June 12, 2019
2007 journal article
Reusable learning objects through peer review: The Expertiza approach
Innovate—Journal of Online Education, 3(6).
Sources: NC State University Libraries, ORCID
Added: June 12, 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.
