1968 search results - page 152 / 394 » The Complexity of Valued Constraint Models |
127
click to vote
TOC
2008
15 years 4 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
150
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
Coalition formation methods allow agents to join together and are thus necessary in cases where tasks can only be performed cooperatively by groups. This is the case in the Reques...
111
click to vote
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
134
click to vote
AAAI
2010
15 years 5 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
176
click to vote
COCOS
2003
Springer
15 years 9 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...