Sciweavers

2488 search results - page 6 / 498
» Distributed Non-binary Constraints
Sort
View
ICASSP
2011
IEEE
12 years 10 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan
JAIR
2010
82views more  JAIR 2010»
13 years 5 months ago
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
Gianluigi Greco, Enrico Malizia, Luigi Palopoli, F...
CAEPIA
2003
Springer
13 years 12 months ago
Distributed Non-binary Constraints
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...
Miguel A. Salido, Federico Barber
IAJIT
2011
13 years 1 months ago
A constraint programming based approach to detect ontology inconsistencies
: This paper proposes a constraint programming based approach to handle ontologies consistency, and more precisely user-defined consistencies. In practice, ontologies consistency i...
Moussa Benaissa, Yahia Lebbah