Sciweavers

360 search results - page 42 / 72
» Timing Minimization by Statistical Timing hMetis-based Parti...
Sort
View
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 2 months ago
Coverage control for nonholonomic agents
— Consider a coverage problem for a team of agents in the plane: target points appear sporadically over time in a bounded environment and must be visited by one of the agents. It...
John Enright, Ketan Savla, Emilio Frazzoli
PDCN
2007
13 years 9 months ago
One-to-all personalized communication in torus networks
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each ...
Weizhen Mao, Jie Chen, William A. Watson III
HIPC
2009
Springer
13 years 5 months ago
Supporting load balancing for distributed data-intensive applications
In data-intensive computing, an important problem that has received relatively little attention is of transparent processing of data stored in remote data repositories. Interesting...
Leonid Glimcher, Vignesh T. Ravi, Gagan Agrawal
COR
2010
164views more  COR 2010»
13 years 7 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
CGO
2003
IEEE
14 years 27 days ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz