Sciweavers

2109 search results - page 183 / 422
» Solving Necklace Constraint Problems
Sort
View
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
14 years 6 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
TSP
2010
15 years 1 months ago
Power allocation for a MIMO relay system with multiple-antenna users
A power allocation or scheduling problem is studied for a multiuser multiple-input multiple-output (MIMO) wireless relay system where there is a non-regenerative relay between one ...
Yuan Yu, Yingbo Hua
ICCV
2011
IEEE
14 years 6 months ago
Optical Flow Estimation Using Learned Sparse Model
Optical flow estimation is a fundamental and ill-posed problem in computer vision. To recover a dense flow field, appropriate spatial constraints have to be enforced. Recent ad...
Kui Jia, Xiaogang Wang, Xiaoou Tang
ATAL
2006
Springer
15 years 10 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
GLOBECOM
2009
IEEE
15 years 4 months ago
On the Efficiency of a Game Theoretic Approach to Sparse Regenerator Placement in WDM Networks
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...
Diego Lucerna, Nicola Gatti, Guido Maier, Achille ...