Sciweavers

5205 search results - page 345 / 1041
» Tilings and model theory
Sort
View
ATAL
2010
Springer
15 years 8 months ago
When do markets with simple agents fail?
We consider (prediction) markets where myopic agents sequentially interact with an automated market maker. We show a broad negative result: by varying the order of participation, ...
Abraham Othman, Tuomas Sandholm
ESA
2010
Springer
136views Algorithms» more  ESA 2010»
15 years 8 months ago
Fast Minor Testing in Planar Graphs
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignas...
CORR
2010
Springer
61views Education» more  CORR 2010»
15 years 7 months ago
Utility and Privacy of Data Sources: Can Shannon Help Conceal and Reveal Information?
Abstract-- The problem of private information "leakage" (inadvertently or by malicious design) from the myriad large centralized searchable data repositories drives the n...
Lalitha Sankar, S. Raj Rajagopalan, H. Vincent Poo...
183
Voted
CPHYSICS
2008
161views more  CPHYSICS 2008»
15 years 6 months ago
Implementing peridynamics within a molecular dynamics code
Peridynamics (PD) is a continuum theory that employs a nonlocal model to describe material properties. In this context, nonlocal means that continuum points separated by a finite ...
Michael L. Parks, Richard B. Lehoucq, Steven J. Pl...
ACTA
2006
108views more  ACTA 2006»
15 years 6 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink