Sciweavers

1480 search results - page 251 / 296
» Ants can solve constraint satisfaction problems
Sort
View
ECCV
2004
Springer
15 years 27 days ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
INFOCOM
2005
IEEE
14 years 4 months ago
On achieving optimal throughput with network coding
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...
Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau
RSP
1998
IEEE
188views Control Systems» more  RSP 1998»
14 years 3 months ago
Performance and Interface Buffer Size Driven Behavioral Partitioning for Embedded Systems
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
T.-C. Lin, Sadiq M. Sait, Walling R. Cyre
ICALP
1997
Springer
14 years 3 months ago
Discrete-Time Control for Rectangular Hybrid Automata
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automatawhere the plant state evolves continuously in real-numbe...
Thomas A. Henzinger, Peter W. Kopke
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 6 months ago
Multiplexed Model Predictive Control
: Most academic control schemes for MIMO systems assume all the control variables are updated simultaneously. MPC outperforms other control strategies through its ability to deal w...
Keck Voon Ling, Jan M. Maciejowski, A. G. Richards...