4850 search results - page 204 / 970 » Proof and Computation in Geometry |
202
click to vote
DALT
2008
Springer
15 years 8 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
168
click to vote
JSYML
2010
15 years 5 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
128
click to vote
TCS
1998
15 years 6 months ago
1998
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
151
click to vote
CIE
2007
Springer
16 years 22 days ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
137
click to vote
VISUALIZATION
2003
IEEE
15 years 11 months ago
2003
IEEE
There are numerous algorithms in graphics and visualization whose performance is known to decay as the topological complexity of the input increases. On the other hand, the standa...