Sciweavers

1664 search results - page 305 / 333
» Making a Case for Multi-Agent Systems
Sort
View
MP
2008
99views more  MP 2008»
14 years 10 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
NETWORK
2006
218views more  NETWORK 2006»
14 years 10 months ago
Quality of service for packet telephony over mobile ad hoc networks
IP telephony over mobile ad hoc networks is a topic of emerging interest in the research arena as one of the paths toward the fixed-mobile convergence in telecommunications networ...
Paolo Giacomazzi, Luigi Musumeci, Giuseppe Caizzon...
BMCBI
2005
156views more  BMCBI 2005»
14 years 10 months ago
A new dynamical layout algorithm for complex biochemical reaction networks
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Katja Wegner, Ursula Kummer
NN
2000
Springer
170views Neural Networks» more  NN 2000»
14 years 9 months ago
Synthetic brain imaging: grasping, mirror neurons and imitation
The article contributes to the quest to relate global data on brain and behavior (e.g. from PET, Positron Emission Tomography, and fMRI, functional Magnetic Resonance Imaging) to ...
Michael A. Arbib, Aude Billard, Marco Iacoboni, Er...
CC
1998
Springer
111views System Software» more  CC 1998»
14 years 9 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson