Sciweavers

2109 search results - page 241 / 422
» Solving Necklace Constraint Problems
Sort
View
EOR
2008
110views more  EOR 2008»
15 years 6 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
CVPR
1997
IEEE
16 years 8 months ago
Independent 3D Motion Detection Based on Depth Elimination in Normal Flow Fields
This paper considers a specific problem of visual perception of motion, namely the problem of visual detection of independent 3D motion. Most of the existing techniques for solvin...
Antonis A. Argyros, Stelios C. Orphanoudakis
RTAS
2008
IEEE
16 years 13 days ago
Equivalence between Schedule Representations: Theory and Applications
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
Matthieu Lemerre, Vincent David, Christophe Aussag...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 10 months ago
Robust Power Allocation for Amplify-and-Forward Relay Networks
Relay power allocation has been shown to provide substantial performance gain in wireless relay networks when perfect global channel state information (CSI) is available. In this p...
Tony Q. S. Quek, Moe Z. Win, Hyundong Shin, Marco ...
IJCAI
2003
15 years 7 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus