245 search results - page 12 / 49 » Locating phase transitions in computationally hard problems |
ACMICEC
2006
ACM
14 years 1 months ago
2006
ACM
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
CP
1999
Springer
13 years 11 months ago
1999
Springer
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
IJCAI
2003
13 years 8 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
KDD
2005
ACM
14 years 7 months ago
2005
ACM
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...