Sciweavers

505 search results - page 9 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
VLSISP
2002
112views more  VLSISP 2002»
13 years 8 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
ECAI
2006
Springer
14 years 3 days ago
Extracting MUCs from Constraint Networks
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
Fred Hemery, Christophe Lecoutre, Lakhdar Sais, Fr...
ANOR
2011
96views more  ANOR 2011»
13 years 3 months ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 8 months ago
Minimizing weighted sum delay for one-to-many file transfer in peer-to-peer networks
Abstract-- This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weig...
Bike Xie, Mihaela van der Schaar, Richard D. Wesel
EUC
2006
Springer
14 years 2 days ago
Efficent Algorithm of Energy Minimization for Heterogeneous Wireless Sensor Network
Abstract. Energy and delay are critical issues for wireless sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Due to the u...
Mei Kang Qiu, Chun Xue, Zili Shao, Qingfeng Zhuge,...