2743 search results - page 375 / 549 » Minimization of an M-convex Function |
187
click to vote
EOR
2011
15 years 28 days ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
188
click to vote
JSAC
2011
15 years 27 days ago
2011
— We investigate spectrum sensing by energy detection based on two different objective functions: a Bayesian sensing cost or the network weighted sum capacity. The Bayesian cost ...
342
click to vote
PE
2011
Springer
15 years 27 days ago
2011
Springer
This paper studies the optimal resource allocation in time-reservation systems. Customers arrive at a service facility and receive service in two steps; in the first step informa...
373
click to vote
ACTA
2011
15 years 26 days ago
2011
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
156
click to vote
JGO
2010
15 years 22 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...