6693 search results - page 1242 / 1339 » On an anytime algorithm for control |
146
Voted
DLS
2008
15 years 5 months ago
2008
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
133
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
142
click to vote
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
129
click to vote
IMC
2007
ACM
15 years 4 months ago
2007
ACM
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
104
click to vote
AAAI
2010
15 years 4 months ago
2010
In a previous paper, Liu argued for the importance of establishing a precise theoretical foundation for program debugging from first principles. In this paper, we present a first ...