Sciweavers

502 search results - page 30 / 101
» Monotone Approximation of Decision Problems
Sort
View
151
Voted
CORR
2012
Springer
218views Education» more  CORR 2012»
13 years 11 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
MST
2010
140views more  MST 2010»
15 years 1 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
125
Voted
ATAL
2007
Springer
15 years 7 months ago
Modeling plan coordination in multiagent decision processes
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
Ping Xuan
130
Voted
AVSS
2006
IEEE
15 years 9 months ago
Large System Decision Fusion Performance in Inhomogeneous Sensor Networks
The problem of decision fusion in a large wireless sensor system with many power-constrained distributed nodes is considered. The sensor network is assumed to be inhomogeneous. i....
Sudharman K. Jayaweera, Kossai Al-Tarazi
ECAI
2004
Springer
15 years 8 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...