4372 search results - page 133 / 875 » Algorithmic Theories of Everything |
146
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
61
Voted
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. This technique com...
91
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
105
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
With the ever expanding Web and the information published on it, effective tools for managing such data and presenting information to users based on their needs are becoming nece...
AAAI
2010
15 years 29 days ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...