1615 search results - page 107 / 323 » Computer science and decision theory |
113
click to vote
WINE
2005
Springer
15 years 6 months ago
2005
Springer
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
120
Voted
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
106
click to vote
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
118
click to vote
ICFP
2007
ACM
16 years 17 days ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
118
Voted
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...