8512 search results - page 352 / 1703 » Computing Theory With Relevance |
172
click to vote
ICFCA
2005
Springer
16 years 8 days ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
172
click to vote
ICFP
2000
ACM
15 years 11 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
186
click to vote
CAV
2009
Springer
15 years 10 months ago
2009
Springer
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
191
click to vote
IE
2007
15 years 8 months ago
2007
How can we help people design well-formed and innovative games? The design Patterns of Christopher Alexander is one methodology that has been proposed to assist in the design of w...
178
click to vote
SIROCCO
2008
15 years 8 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...