4894 search results - page 349 / 979 » The Guarding Problem - Complexity and Approximation |
174
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
167
click to vote
WASA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
194
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
172
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
180
click to vote
CCE
2004
15 years 6 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...