Sciweavers

409 search results - page 4 / 82
» Matching Scenarios with Timing Constraints
Sort
View
ISPD
1999
ACM
83views Hardware» more  ISPD 1999»
13 years 12 months ago
Efficient solution of systems of orientation constraints
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...
Joseph L. Ganley
PERCOM
2006
ACM
14 years 7 months ago
Maximum Weighted Matching with Interference Constraints
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar
ICC
2009
IEEE
152views Communications» more  ICC 2009»
14 years 2 months ago
On Concurrent Multipath Transfer in SCTP-Based Handover Scenarios
Abstract—Handling mobility at the transport layer is a promising approach to achieve seamless handover in the context of heterogeneous wireless access networks. In particular, fe...
Lukasz Budzisz, Ramon Ferrús, Ferran Casade...
WEBI
2010
Springer
13 years 5 months ago
Expertise Matching via Constraint-Based Optimization
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
Wenbin Tang, Jie Tang, Chenhao Tan
AAAI
2010
13 years 9 months ago
Propagating Conjunctions of AllDifferent Constraints
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
Christian Bessiere, George Katsirelos, Nina Narody...