Sciweavers

921 search results - page 83 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 1 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
AI
2008
Springer
13 years 8 months ago
On the notion of concept I
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
Michael Freund
FORTE
2008
13 years 9 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
MIR
2006
ACM
129views Multimedia» more  MIR 2006»
14 years 1 months ago
Diversity in multimedia information retrieval research
Multimedia information retrieval is a highly diverse field. A variety of data types, research problems, methodologies are involved. Researchers in the field come from very diff...
James Ze Wang, Nozha Boujemaa, Alberto Del Bimbo, ...
POPL
2008
ACM
14 years 8 months ago
The intensional content of Rice's theorem
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
Andrea Asperti