Sciweavers

1964 search results - page 3 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
13 years 11 months ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...
ICTAI
2003
IEEE
13 years 11 months ago
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
Benjamin W. Wah, Yixin Chen
IEEECGIV
2006
IEEE
13 years 11 months ago
Incremental Voxel Colouring by Ray Traversal
Image based reconstruction from multiple views is an interesting challenge. Recently methods of optimisation based voxel colouring have appeared, which make use of incremental vis...
O. Batchelor, R. Mukundan, R. Green
BMVC
2001
13 years 8 months ago
Adaptive Visual System for Tracking Low Resolution Colour Targets
This paper addresses the problem of using appearance and motion models in classifying and tracking objects when detailed information of the object’s appearance is not available....
Pakorn KaewTrakulPong, Richard Bowden
SAC
2010
ACM
14 years 18 days ago
MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
David Portugal, Rui Rocha