Sciweavers

1342 search results - page 125 / 269
» Ordered Programs as Abductive Systems
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
13 years 10 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
ATAL
2009
Springer
14 years 4 months ago
A demonstration of the Polaris poker system
Poker games provide a useful testbed for modern Artificial Intelligence techniques. Unlike many classical game domains such as chess and checkers, poker includes elements of impe...
Michael H. Bowling, Nicholas Abou Risk, Nolan Bard...
IPPS
2000
IEEE
14 years 1 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
CSMR
1999
IEEE
14 years 2 months ago
Impact of Function Pointers on the Call Graph
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
Giuliano Antoniol, F. Calzolari, Paolo Tonella
MICS
2008
108views more  MICS 2008»
13 years 10 months ago
Efficient Intensional Implementation for Lazy Functional Languages
The intensional transformation is a technique that can be used in order to eliminate higher-order functions from a functional program by introducing appropriate context manipulatio...
Angelos Charalambidis, Athanasios Grivas, Nikolaos...