Sciweavers

830 search results - page 4 / 166
» Generalizing Global Constraints Based on Network Flows
Sort
View
IJCAI
2007
13 years 9 months ago
Learning Implied Global Constraints
Finding a constraint network that will be efficiently solved by a constraint solver requires a strong expertise in Constraint Programming. Hence, there is an increasing interest i...
Christian Bessière, Remi Coletta, Thierry P...
ICCAD
2000
IEEE
188views Hardware» more  ICCAD 2000»
13 years 12 months ago
Bus Optimization for Low-Power Data Path Synthesis Based on Network Flow Method
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
Sungpack Hong, Taewhan Kim
JNW
2007
112views more  JNW 2007»
13 years 7 months ago
A Multi-Commodity Flow Model for Optimal Routing in Wireless MESH Networks
— We propose a mathematical programming model of the routing problem in multi-hop wireless networks that takes into account quality of service requirements considering bandwidth ...
Antonio Capone, Fabio Martignon
PERCOM
2006
ACM
14 years 7 months ago
A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop Wireless Networks
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
Vinay Kolar, Nael B. Abu-Ghazaleh
SCP
1998
138views more  SCP 1998»
13 years 7 months ago
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
Roberto Bagnara