Sciweavers

1933 search results - page 350 / 387
» A Dynamic Theory of Ontology
Sort
View
SPAA
2003
ACM
14 years 2 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
ICCS
2003
Springer
14 years 2 months ago
Anisotropic Convection Model for the Earth's Mantle
The paper presents a theory for modeling flow in anisotropic, viscous rock. This theory has originally been developed for the simulation of large deformation processes including t...
Hans-B. Mühlhaus, M. Cada, Louis Moresi
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
14 years 1 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 27 days ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
DBPL
1993
Springer
89views Database» more  DBPL 1993»
14 years 27 days ago
Database Programming in Transaction Logic
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
Anthony J. Bonner, Michael Kifer, Mariano P. Conse...