Sciweavers

9842 search results - page 16 / 1969
» Problem complexity
Sort
View
IGPL
2011
13 years 2 months ago
J-MADeM, a market-based model for complex decision problems
This paper presents J-MADeM, a multi-modal decision making mechanism to provide agents in a Multi-Agent Systems (MAS) with a market-based model for complex decision problems. J-MA...
Francisco Grimaldo, Miguel Lozano, Fernando Barber
ICMAS
2000
13 years 9 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
LATIN
2010
Springer
13 years 11 months ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
IJCAI
1997
13 years 9 months ago
Computational Complexity of Multi-way, Dataflow Constraint Problems
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
Gilles Trombettoni, Bertrand Neveu
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
14 years 2 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità