3353 search results - page 586 / 671 » Laver and set theory |
185
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
150
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
204
click to vote
WWW
2009
ACM
16 years 1 months ago
2009
ACM
Traditional relation extraction methods require pre-specified relations and relation-specific human-tagged examples. Bootstrapping systems significantly reduce the number of tr...
205
click to vote
LICS
2009
IEEE
16 years 28 days ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
163
click to vote
ATAL
2009
Springer
16 years 27 days ago
2009
Springer
While the class of congestion games has been thoroughly studied in the multi-agent systems literature, settings with incomplete information have received relatively little attenti...