Click here to Skip to main content
Rate this: bad
Please Sign up or sign in to vote.
See more: Java multithreading
how we do he coding of agent
in multi agent environment, specifically for air line reservation.
Posted 3-Feb-13 21:03pm
Richard MacCutchan at 4-Feb-13 5:02am
This is not a valid question, you need to provide more specific details of your problem.
Rate this: bad
Please Sign up or sign in to vote.

Solution 1

I have implemented agent based systems in the past. The principle I have worked to is that there are three levels, Manager, Agent and Worker.
The Manager receives all the requests and ensures they are passed to the correct Agent then passes the replies back to the callers. Simple and easily defined responsibility, can't go too wrong there.
The Agent maintains a FIFO queue of requests and has one or more Workers to manage the work load. When a Worker is free, it receives a new request.
The Workers process the individual requests. This is the only part of the system that changes for different types.
Simple, effective and very expandable. Look out in the coming months and there will be an article on this if I ever get it finished.
Rate this: bad
Please Sign up or sign in to vote.

Solution 2

using namespace std;
int main() {
  int x, y;
  cout<<"what is your height?"<<"\nyour feet: ";
  cout<<"your inches: ";
  cout<<"your height is: "<<x<<"'"<<" and "<<y<<"''";
  cout<<"\nYou are tall!";
  return 0;

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
0 Maciej Los 495
1 Sergey Alexandrovich Kryukov 479
2 OriginalGriff 360
3 Abhinav S 250
4 CHill60 240
0 Sergey Alexandrovich Kryukov 10,102
1 OriginalGriff 9,495
2 Peter Leow 5,241
3 Kornfeld Eliyahu Peter 3,373
4 Maciej Los 3,076

Advertise | Privacy | Mobile
Web01 | 2.8.150327.1 | Last Updated 4 Feb 2013
Copyright © CodeProject, 1999-2015
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100