Sciweavers

314 search results - page 12 / 63
» A Constraint Based Agent for TAC-SCM
Sort
View
IAT
2003
IEEE
14 years 19 days ago
Agent-based decision support for actual-world procurement scenarios
Multi-item, multi-unit negotiations in industrial procurement pose serious challenges to buying agents when trying to determine the best set of providering agents’ offers. Typic...
Juan A. Rodríguez-Aguilar, Andrea Giovannuc...
ATAL
2007
Springer
14 years 1 months ago
Unifying distributed constraint algorithms in a BDI negotiation framework
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
Bao Chau Le Dinh, Kiam Tian Seow
CP
1995
Springer
13 years 11 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
AAAI
2010
13 years 8 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek
IFIP
1998
Springer
13 years 11 months ago
Scheduling in a Multi-Agent Environment
A new scheduling agent for existing CIM multi-agent system is being currently developed at the Technical University of Kosice. The basic idea is to create an agent based on Schedu...
M. Schmotzer, Jan Paralic, Julius Csontó