Sciweavers

4850 search results - page 150 / 970
» Proof and Computation in Geometry
Sort
View
MFCS
1998
Springer
15 years 10 months ago
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate
Michael Alekhnovich, Samuel R. Buss, Shlomo Moran,...
CIE
2010
Springer
15 years 11 months ago
What Is the Problem with Proof Nets for Classical Logic?
This paper is an informal (and nonexhaustive) overview over some existing notions of proof nets for classical logic, and gives some hints why they might be considered to be unsatis...
Lutz Straßburger
ATAL
2010
Springer
15 years 7 months ago
Evolving policy geometry for scalable multiagent learning
A major challenge for traditional approaches to multiagent learning is to train teams that easily scale to include additional agents. The problem is that such approaches typically...
David B. D'Ambrosio, Joel Lehman, Sebastian Risi, ...
WETICE
1997
IEEE
15 years 10 months ago
Capturing Geometry Rationale for Collaborative Design
When an artifact is designed the typical output consists of documents describing the final result of a long series of deliberations and tradeoffs by the participants of collaborat...
Mark Klein
CCCG
2010
15 years 8 months ago
Existence of zone diagrams in compact subsets of uniformly convex spaces
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...
Eva Kopecká, Daniel Reem, Simeon Reich