Sciweavers

478 search results - page 87 / 96
» Monads of Regular Theories
Sort
View
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
15 years 5 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
SIGECOM
2009
ACM
134views ECommerce» more  SIGECOM 2009»
15 years 5 months ago
On representing coalitional games with externalities
We consider the issue of representing coalitional games in multiagent systems with externalities (i.e., in systems where the performance of one coalition may be affected by other ...
Tomasz P. Michalak, Talal Rahwan, Jacek Sroka, And...
TBILLC
2005
Springer
15 years 4 months ago
Case Attraction in Ancient Greek
Case attraction has stood as a puzzling, and elusive, oddity of older Indo-European languages. This paper focuses on attraction in Ancient Greek, establishing both the regularity o...
Scott Grimm
IPSN
2004
Springer
15 years 4 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
SMA
2003
ACM
173views Solid Modeling» more  SMA 2003»
15 years 4 months ago
Automating the CAD/CAE dimensional reduction process
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
Krishnan Suresh