Sciweavers

1831 search results - page 226 / 367
» Time Constraints in Workflow Systems
Sort
View
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
15 years 2 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
CP
2009
Springer
16 years 5 months ago
Hull Consistency under Monotonicity
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to eac...
Gilles Chabert, Luc Jaulin
DELTA
2008
IEEE
15 years 11 months ago
FPGA implementation of a Single Pass Connected Components Algorithm
The classic connected components labelling algorithm requires two passes through an image. This paper presents an algorithm that allows the connected components to be analysed in ...
Christopher T. Johnston, Donald G. Bailey
ECRTS
2007
IEEE
15 years 11 months ago
Tardiness Bounds for FIFO Scheduling on Multiprocessors
FIFO scheduling is often considered to be inappropriate for scheduling workloads that are subject to timing constraints. However, FIFO is implemented in many generalpurpose OSs, a...
Hennadiy Leontyev, James H. Anderson
GLOBECOM
2006
IEEE
15 years 10 months ago
Power Optimal Opportunistic Scheduling
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
Abhijeet Bhorkar, Abhay Karandikar, Vivek S. Borka...