Sciweavers

409 search results - page 10 / 82
» Matching Scenarios with Timing Constraints
Sort
View
ICPADS
2007
IEEE
14 years 1 months ago
Supporting deadline monotonic policy over 802.11 average service time analysis
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario w...
Inès El Korbi, Leïla Azouz Saïdan...
ERSA
2006
132views Hardware» more  ERSA 2006»
13 years 9 months ago
Combinatorial Optimization in Mapping Generalized Template Matching onto Reconfigurable Computers
: A brief review of mapping generalized template matching operations onto reconfigurable computers is given. A combinatorial optimization process, where the objective is to minimiz...
Xuejun Liang, Qutaibah M. Malluhi
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
13 years 9 months ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh
WSC
2007
13 years 10 months ago
Expecting the unexpected: representing, reasoning about, and assessing construction project contingencies
Planning, scheduling and effective management of contingencies are crucial for the successful management of construction projects. In this paper we explore a mathematical represen...
G. Ryan Anderson, Nilufer Onder, Amlan Mukherjee
AAAI
1994
13 years 9 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin