Sciweavers

6693 search results - page 1242 / 1339
» On an anytime algorithm for control
Sort
View
DLS
2008
149views Languages» more  DLS 2008»
13 years 10 months ago
Gradual typing with unification-based inference
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...
Jeremy G. Siek, Manish Vachharajani
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
13 years 10 months ago
Selfish Bin Packing
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...
Leah Epstein, Elena Kleiman
ESOP
2008
Springer
13 years 10 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
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...
C.-H. Luke Ong
IMC
2007
ACM
13 years 9 months ago
Learning network structure from passive measurements
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...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
AAAI
2010
13 years 9 months ago
Automated Program Debugging Via Multiple Predicate Switching
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 ...
Yongmei Liu, Bing Li
« Prev « First page 1242 / 1339 Last » Next »