Sciweavers

420 search results - page 30 / 84
» Some Algorithmic Problems in Polytope Theory
Sort
View
ATAL
2001
Springer
15 years 2 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 9 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
15 years 4 months ago
Extending Argumentation to Make Good Decisions
Abstract. Argumentation has been acknowledged as a powerful mechanism for automated decision making. In this context several recent works have studied the problem of accommodating ...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud
MOC
2002
118views more  MOC 2002»
14 years 9 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
INFOCOM
2012
IEEE
13 years 4 days ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang