Sciweavers

1994 search results - page 224 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
HYBRID
2009
Springer
15 years 4 months ago
Optimal Boundary Control of Convention-Reaction Transport Systems with Binary Control Functions
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...
Falk M. Hante, Günter Leugering
COMPULOG
1999
Springer
15 years 2 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
IPPS
2007
IEEE
15 years 4 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
92
Voted
CLUSTER
2004
IEEE
14 years 10 months ago
DyRAM: An Active Reliable Multicast Framework for Data Distribution
Group communications (multicast) are foreseen to be one of the most critical yet challenging technologies to meet the exponentially growing demands for data distribution in a large...
Moufida Maimour, CongDuc Pham
ICCV
2007
IEEE
16 years 2 days ago
Probabilistic Color and Adaptive Multi-Feature Tracking with Dynamically Switched Priority Between Cues
We present a probabilistic multi-cue tracking approach constructed by employing a novel randomized template tracker and a constant color model based particle filter. Our approach ...
François Le Clerc, Lionel Oisel, Patrick P&...