Sciweavers

8512 search results - page 418 / 1703
» Computing Theory With Relevance
Sort
View
BIRTHDAY
2010
Springer
15 years 7 months ago
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
Christoph Benzmüller
ENTCS
2006
101views more  ENTCS 2006»
15 years 6 months ago
Towards "Dynamic Domains": Totally Continuous Cocomplete Q-categories
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...
Isar Stubbe
159
Voted
SIAMIS
2008
124views more  SIAMIS 2008»
15 years 6 months ago
Area Distances of Convex Plane Curves and Improper Affine Spheres
The area distance to a convex plane curve is an important concept in computer vision. In this paper we describe a strong link between area distances and improper affine spheres. Th...
Marcos Craizer, Moacyr Alvim, Ralph Teixeira
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
173
Voted
SAC
2002
ACM
15 years 6 months ago
Contradictions and critical issues during system evolution
In this paper the issue of system evolution is addressed. Activity Theory and the concept of exapansive cycles are reviewed as theories to explain systemic evolution. Contradictio...
Mark-Alexander Sujan, Antonio Rizzo, Alberto Pasqu...