Sciweavers

339 search results - page 31 / 68
» Can we refactor conditional compilation into aspects
Sort
View
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
13 years 12 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
UAI
2008
13 years 9 months ago
Learning Arithmetic Circuits
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
Daniel Lowd, Pedro Domingos
CGO
2007
IEEE
14 years 2 months ago
Run-Time Support for Optimizations Based on Escape Analysis
The JavaTM programming language does not allow the programmer to influence memory management. An object is usually allocated on the heap and deallocated by the garbage collector ...
Thomas Kotzmann, Hanspeter Mössenböck
ALIFE
2005
13 years 7 months ago
Agency in Natural and Artificial Systems
We analyze the conditions for agency in natural and artificial systems. In the case of basic (natural) autonomous systems, self-construction and activity in the environment are two...
Alvaro Moreno, Arantza Etxeberria
COMPGEOM
2008
ACM
13 years 9 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos