5995 search results - page 839 / 1199 » Algorithmic Game Theory |
184
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
186
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
179
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
189
click to vote
CADE
2007
Springer
16 years 28 days ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
195
click to vote
DAARC
2007
Springer
16 years 28 days ago
2007
Springer
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...