Sciweavers

11160 search results - page 347 / 2232
» Incompleteness in a General Setting
Sort
View
CORR
2010
Springer
44views Education» more  CORR 2010»
15 years 4 months ago
Maximum union-free subfamilies
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in th...
Jacob Fox, Choongbum Lee, Benny Sudakov
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
15 years 11 months ago
Nash equilibrium problems with congestion costs and shared constraints
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta
SIGSOFT
2008
ACM
16 years 7 months ago
Semi-automating small-scale source code reuse via structural correspondence
Developers perform small-scale reuse tasks to save time and to increase the quality of their code, but due to their small scale, the costs of such tasks can quickly outweigh their...
Rylan Cottrell, Robert J. Walker, Jörg Denzin...
MOBIHOC
2009
ACM
16 years 7 months ago
Secure multidimensional range queries in sensor networks
Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor node...
Rui Zhang, Jing Shi, Yanchao Zhang
POPL
2010
ACM
16 years 4 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins