1197 search results - page 50 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
DISOPT
2008
13 years 9 months ago
2008
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
AAAI
2011
12 years 9 months ago
2011
Sustainable resource management in many domains presents large continuous stochastic optimization problems, which can often be modeled as Markov decision processes (MDPs). To solv...
EGH
2003
Springer
14 years 2 months ago
2003
Springer
—We present a method for using programmable graphics hardware to solve a variety of boundary value problems. The time-evolution of such problems is frequently governed by partial...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
To recognize three-dimensional objects it is important to
model how their appearances can change due to changes
in viewpoint. A key aspect of this involves understanding
which o...