Agent-Based Negotiation in E-Marketing

2011 ◽  
pp. 88-92
Author(s):  
V.K. Murthy ◽  
E.V. Krishnamurthy
Keyword(s):  
Data Structures ◽  
Agent Based ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages ◽  
Active Objects

This article describes in brief the design of agent-based negotiation system in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures.

Agent-Based Negotiation in E-Marketing

2005 ◽  
pp. 88-92
Author(s):  
V. K. Murthy ◽  
E. V. Krishnamurthy
Keyword(s):  
Data Structures ◽  
Agent Based ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages ◽  
Active Objects

This article describes in brief the design of agent-based negotiation system in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures.

Designing Agent-Based Negotiation for E-Marketing

2011 ◽  
pp. 287-299
Author(s):  
V. K. Murthy
Keyword(s):  
Data Structures ◽  
Weighted Graph ◽  
Negotiation Process ◽  
Agent Based ◽  
Negotiation Protocol ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages

This chapter describes how to design agent-based negotiation systems in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called a protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures. We also describe how to detect the termination of the negotiation process based on Commission-Savings-Tally Algorithm. A simple example illustrates how a set of agents can participate in a negotiation protocol to find the shortest travel route on a map of cities represented as a directed weighted graph.

Designing Agent-Based Negotiation for E-Marketing

2011 ◽  
pp. 665-678
Author(s):  
V. K. Murthy
Keyword(s):  
Data Structures ◽  
Weighted Graph ◽  
Negotiation Process ◽  
Agent Based ◽  
Negotiation Protocol ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages

This chapter describes how to design agent-based negotiation systems in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called a protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures. We also describe how to detect the termination of the negotiation process based on Commission-Savings-Tally Algorithm. A simple example illustrates how a set of agents can participate in a negotiation protocol to find the shortest travel route on a map of cities represented as a directed weighted graph.

High Level Data Structures for GPGPU Programming in a Statically Typed Language

2016 ◽  
Vol 45 (2) ◽  
pp. 242-261 ◽  
Author(s):  
Mathias Bourgoin ◽  
Emmanuel Chailloux ◽  
Jean-Luc Lamotte
Keyword(s):  
Data Structures ◽  
Level Data ◽  
High Level

scholarly journals Tool for SPARQL Querying over Compact RDF Representations

2021 ◽  
Vol 7 (1) ◽  
pp. 33
Author(s):  
Delfina Ramos-Vidal ◽  
Guillermo de Bernardo
Keyword(s):  
Data Storage ◽  
Data Structures ◽  
Low Level ◽  
Level Data ◽  
Query Engine ◽  
Compact Data Structures ◽  
High Level

We present an architecture for the efficient storing and querying of large RDF datasets. Our approach seeks to store RDF datasets in very little space while offering complete SPARQL functionality. To achieve this, our proposal was built over HDT, an RDF serialization framework, and its interaction with the Jena query engine. We propose a set of modifications to this framework in order to incorporate a range of space-efficient compact data structures for data storage and access, while using high-level capabilities to answer more complicated SPARQL queries. As a result, our approach provides a standard mechanism for using low-level data structures in complicated query situations requiring SPARQL searches, which are typically not supported by current solutions.

High-level data structures

2012 ◽  
Vol 55 (12) ◽  
pp. 90-90 ◽  
Author(s):  
Yannis Smaragdakis
Keyword(s):  
Data Structures ◽  
Level Data ◽  
High Level

Retrieval of high-level data structures from stereo vision data

1991 ◽  
pp. 312-321
Author(s):  
Fidenzio Burbello ◽  
S. B. Pollard ◽  
J. Porrill ◽  
J. E. W. Mayhew
Keyword(s):  
Data Structures ◽  
Stereo Vision ◽  
Level Data ◽  
High Level
Sign in / Sign up

Export Citation Format

Share Document