127 search results - page 19 / 26 » A linear approximation method for the Shapley value |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
JMLR
2006
14 years 9 months ago
2006
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
DAGSTUHL
2007
14 years 11 months ago
2007
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
ICITA
2005
IEEE
15 years 3 months ago
2005
IEEE
Optimum theorems for combining QoS metrics to reduce computation time in nodes (routers) is proposed based on fundamental theorems on QoS metrics. The proposed theorems unify sele...
ATMOS
2010
14 years 8 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...