8825 search results - page 298 / 1765 » All for one or one for all |
118
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
118
Voted
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
122
Voted
SIROCCO
2004
15 years 3 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
113
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
113
Voted
TREC
2003
15 years 3 months ago
2003
CL Research’s question-answering system for TREC 2003 was modified away from reliance on database technology to the core underlying technology of using massive XML-tagging for p...