Sciweavers

2917 search results - page 305 / 584
» Satisfying Interaction Constraints
Sort
View
CPAIOR
2010
Springer
15 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ICCAD
2010
IEEE
141views Hardware» more  ICCAD 2010»
15 years 4 months ago
Local clock skew minimization using blockage-aware mixed tree-mesh clock network
Clock network construction is one key problem in high performance VLSI design. Reducing the clock skew variation is one of the most important objectives during clock network synthe...
Linfu Xiao, Zigang Xiao, Zaichen Qian, Yan Jiang, ...
SENSYS
2010
ACM
15 years 4 months ago
Efficient diagnostic tracing for wireless sensor networks
Wireless sensor networks (WSNs) are hard to program due to unconventional programming models used to satisfy stringent resource constraints. The common event-driven concurrent pro...
Vinaitheerthan Sundaram, Patrick Th. Eugster, Xian...
ICC
2009
IEEE
118views Communications» more  ICC 2009»
15 years 4 months ago
Downlink Resource Allocation for OFDMA-Based Multiservice Networks with Imperfect CSI
Abstract--This paper addresses practical implementation issues of resource allocation in OFDMA networks: inaccuracy of channel state information (CSI) available to the resource all...
Mohamad Khattar Awad, Veluppillai Mahinthan, Mehri...
IANDC
2010
115views more  IANDC 2010»
15 years 4 months ago
18th International Conference on Concurrency Theory
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
Luís Caires, Vasco Thudichum Vasconcelos