NDLI: Determining the number of messages transmitted for the temporary links in the case of ABT family techniques

Please wait, while we are loading the content...

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007)

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)

SYNASC 2005 Committees

Natural computation for business intelligence from Web usage mining

Membrane computing as a framework for modeling economic processes

Theory and practice of programming applied to membrane systems

Rule-based programming with /spl rho/Log

A direct products of fields approach to comprehensive Grobner bases over finite fields

Checking RSC criteria for extended Dixon resultant by interpolation method

A connectivity analysis approach in geometric constraint solving

Symbolic modelling of database representations

Archeology of code duplication: recovering duplication chains from small duplication fragments

Integrating role activity diagrams and hybrid IDEF for business process modeling using MDA

A new core-based method for hierarchical incremental clustering

Using R-trees in content-based region query with spatial bounds

Performance analysis of generics in scientific computing

Building an object oriented computational algebra system based on design patterns

COMODI: on the graphical user interface

Using Excel as a front-end for MLF

Remarks on evaluation of correlation dimension for 5 French stock data

AFOPT algorithm for multilevel databases

Adaptive AFOPT algorithm

A combinative method for decision tree construction

Cryptanalysis of an authentication protocol

General secret sharing based on determinants

A generalization of the cellular automata rule-30 cryptoscheme

Data compression using surrounding contexts

Adapting a partitioning-based heuristic load-balancing algorithm to heterogeneous computing environments

Distributed database replication - a game theory?

Multiple 1D data parallel wavelet transform

Logic restructuring for delay balancing in wave-pipelined circuits: an integer programming approach

VirtualDive - a VR-based educational virtual environment

A reference implementation of ADF (Agent Developing Framework): semantic Web-based agent communication

Mobile agents in a multi-agent e-commerce system

Determining the number of messages transmitted for the temporary links in the case of ABT family techniques

Embedding emotions in an artificial tutor

Colored Petri nets state-space reduction via symbolic execution

A formal specification and performance evaluation of the purchase phase in the SET protocol

An algorithm for automated generation of invariants for loops with conditionals

Specifications and verification of network protocols by process algebra

Specification of coordinated objects and verification of their temporal properties

Functional-based synthesis of systolic online multipliers

Emotional ant based modeling of crowd dynamics

Performance tuning of evolutionary algorithms using particle sub swarms

Improving ant systems using a local updating rule

A reinforcement learning algorithm for spiking neural networks

On the controllability of the continuous-time Hopfield-type neural networks

A New Nature-Inspired Computation Model Ising Model with Rays

Symbolic regression on noisy data with genetic and gene expression programming

A GEP-based approach for solving Fredholm first kind integral equations

Computer aided diagnosis for lung CT using artificial life models

A model for parallel evolutionary search

A new subpopulation model for evolutionary multimodal optimization

Density based clustering with crowding differential evolution

Verification of resource constraints for concurrent workflows

Timed workflow nets

Instantiating nets and their applications to workflow nets

Modular analysis of concurrency in jumping Petri nets

One and two polarizations, membrane creation and objects complexity in P systems

Modelling parallel phenomena in conversations with P systems

On P systems with bounded parallelism

Symbolic representations of biological oscillations

A hardware circuit for selecting active rules in transition P systems

P colonies working in the maximally parallel and in the sequential mode

A simulator and an evolution program for conformon-P systems

On symport/antiport P systems with one or two symbols

Investigating local evolutions in dynamical probabilistic P systems

Characterizing tractability with membrane creation

Simulation of continuous-time P systems using descriptive rewriting timed Petri nets

On generating trees by P systems with active membranes

Determining the number of messages transmitted for the temporary links in the case of ABT family techniques

Content Provider	IEEE Xplore Digital Library
Author	Muscalagiu, J. Horia-Emil, P. Panoiu, M.
Copyright Year	2005
Description	Author affiliation: Fac. of Eng., "Politehnica" Univ. of Timisoara, Hunedoara, Romania (Muscalagiu, J.; Horia-Emil, P.)
Abstract	Starting from the algorithm of asynchronous backtracking (ABT), a unifying framework for some of the asynchronous techniques has recently been suggested. Within this unifying frameworld several techniques have been derived, known as the ABT family. They differ in the way they store no goods, but they all use additional communication links between unconnected agents to detect obsolete information. A first way to remove obsolete information is to add new communication links to allow a nogood owner to determine whether this no good is obsolete or not. The second solution consists in temporary keeping the links. A new link remains until a fixed number of messages have been exchanged through it. After that, it is removed. There is no optimal value determined for that number of messages. This article investigates different values for the number of messages, values that are either statically determined (before the run) or dynamically during the runtime. A dynamical solution for determining the number of messages necessary for maintaining a connection is proposed, the experiments show a better efficiency in comparison with the standard Yokoo variant.
File Size	229294
File Format	PDF
ISBN	0769524532
DOI	10.1109/SYNASC.2005.32
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-09-25
Publisher Place	Romania
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Software maintenance Computer aided software engineering Runtime Mathematics Software standards Dynamic programming Technology planning Kernel Informatics Intelligent agent
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in