1381 search results - page 200 / 277 » Computational Complexity of Constraint Satisfaction |
146
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
145
click to vote
ICTAI
2010
IEEE
15 years 1 months ago
2010
IEEE
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
171
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
235
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
127
click to vote
CCS
2009
ACM
16 years 4 months ago
2009
ACM
The successful deployment of a security policy is closely related not only to the complexity of the security requirements but also to the capabilities/functionalities of the secur...