807 search results - page 37 / 162 » Competition Adds Complexity |
IAT
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
SLP
1994
14 years 11 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
157
click to vote
ISSAC
2011
Springer
14 years 18 days ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
AAAI
2007
15 years 1 days ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
113
click to vote
SP
2002
IEEE
14 years 9 months ago
2002
IEEE
When Java was first introduced, there was a perception that its many benefits came at a significant performance cost. In the particularly performance-sensitive field of numerical ...