420 search results - page 74 / 84 » Some Algorithmic Problems in Polytope Theory |
102
click to vote
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
86
Voted
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
79
Voted
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups ca...
77
Voted
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Although personalized search has been proposed for many years and many personalization strategies have been investigated, it is still unclear whether personalization is consistent...
SBIA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...