Sciweavers

11371 search results - page 296 / 2275
» The network inhibition problem
Sort
View
EMSOFT
2009
Springer
15 years 10 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 9 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
190
Voted
ICNSC
2008
IEEE
16 years 1 months ago
Facility Location Optimization via Multi-Agent Robotic Systems
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
Miad Moarref, Hassan Sayyadi
165
Voted
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
15 years 11 months ago
On LQG joint optimal scheduling and control under communication constraints
Abstract— In this paper, we consider a discrete-time stochastic system, where sensor measurements are sent over a network to the controller. The design objective is a non-classic...
Adam Molin, Sandra Hirche
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
15 years 8 months ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...