Sciweavers

1197 search results - page 146 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
JFR
2008
76views more  JFR 2008»
13 years 8 months ago
Robust trajectory tracking for a reversing tractor trailer
Tractor-trailer reversing is a classical non-linear control problem in which many of the solutions proposed in the literature perform poorly in the presence of real-world constrai...
Cédric Pradalier, Kane Usher
CDC
2009
IEEE
211views Control Systems» more  CDC 2009»
14 years 28 days ago
An event-triggered distributed primal-dual algorithm for Network Utility maximization
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
Pu Wan, Michael D. Lemmon
TWC
2008
235views more  TWC 2008»
13 years 7 months ago
Optimal spectrum sensing framework for cognitive radio networks
Spectrum sensing is the key enabling technology for cognitive radio networks. The main objective of spectrum sensing is to provide more spectrum access opportunities to cognitive r...
Won-Yeol Lee, Ian F. Akyildiz
IAT
2005
IEEE
14 years 1 months ago
An Approximate Pareto Optimal Cooperative Negotiation Model for Multiple
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
Nicola Gatti, Francesco Amigoni