8582 search results - page 322 / 1717 » Here or There |
194
click to vote
TARK
2007
Springer
16 years 28 days ago
2007
Springer
Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work [Halpern and Rˆego 2006], w...
158
click to vote
TLCA
2007
Springer
16 years 28 days ago
2007
Springer
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
167
click to vote
TLCA
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
169
click to vote
WADS
2007
Springer
16 years 27 days ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
162
click to vote
WG
2007
Springer
16 years 27 days ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...