Sciweavers

1494 search results - page 164 / 299
» Kernels for Global Constraints
Sort
View
AMC
2005
206views more  AMC 2005»
13 years 9 months ago
Logistics networks: A game theory application for solving the transshipment problem
As competition from emerging economies such as China and India puts pressure on global supply chains and as new constraints emerge, it presents opportunities for approaches such a...
Pedro M. Reyes
TCS
2008
13 years 9 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
RTAS
2010
IEEE
13 years 8 months ago
Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
Cong Liu, James H. Anderson
CVPR
2012
IEEE
12 years 2 days ago
Dense Lagrangian motion estimation with occlusions
We couple occlusion modeling and multi-frame motion estimation to compute dense, temporally extended point trajectories in video with significant occlusions. Our approach combine...
Susanna Ricco, Carlo Tomasi
RSS
2007
119views Robotics» more  RSS 2007»
13 years 11 months ago
Emergent Task Allocation for Mobile Robots
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...
Nuzhet Atay, O. Burçhan Bayazit