9842 search results - page 287 / 1969 » Problem complexity |
178
click to vote
CP
2004
Springer
16 years 5 days ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
232
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
194
click to vote
ECAI
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
162
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
209
click to vote
COMPUTING
2008
15 years 6 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...