Sciweavers

1380 search results - page 161 / 276
» Computing the optimal strategy to commit to
Sort
View
CCGRID
2009
IEEE
13 years 9 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
AUTOMATICA
2010
99views more  AUTOMATICA 2010»
13 years 8 months ago
Continuous trajectory planning of mobile sensors for informative forecasting
This paper addresses planning of continuous paths for mobile sensors to reduce uncertainty in some quantities of interest in the future. The mutual information between the measure...
Han-Lim Choi, Jonathan P. How
WINE
2010
Springer
251views Economy» more  WINE 2010»
13 years 5 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis
CVPR
2011
IEEE
12 years 11 months ago
Discriminative Spatial Pyramid
Spatial Pyramid Representation (SPR) is a widely used method for embedding both global and local spatial information into a feature, and it shows good performance in terms of gene...
Tatsuya Harada, Yoshitaka Ushiku, Yuya Yamashita, ...
CVPR
2007
IEEE
14 years 10 months ago
Precise Registration of 3D Models To Images by Swarming Particles
The precise alignment of a 3D model to 2D sensor images to recover the pose of an object in a scene is an important topic in computer vision. In this work, we outline a registrati...
Joerg Liebelt, Klaus Schertler