Sciweavers

366 search results - page 7 / 74
» Agent Compromises in Distributed Problem Solving
Sort
View
ATAL
2006
Springer
13 years 11 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama
ATAL
2010
Springer
13 years 8 months ago
Infinite order Lorenz dominance for fair multiagent optimization
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
Boris Golden, Patrice Perny
CSCLP
2008
Springer
13 years 9 months ago
Solving CSPs with Naming Games
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
Stefano Bistarelli, Giorgio Gosti
IWDC
2004
Springer
156views Communications» more  IWDC 2004»
14 years 22 days ago
Agent-Based Distributed Intrusion Alert System
Intrusion detection for computer systems is a key problem in today’s networked society. Current distributed intrusion detection systems (IDSs) are not fully distributed as most o...
Arjita Ghosh, Sandip Sen
ANOR
2007
151views more  ANOR 2007»
13 years 7 months ago
Distributed personnel scheduling - negotiation among scheduling agents
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
Eliezer Kaplansky, Amnon Meisels