Sciweavers

331 search results - page 34 / 67
» HOLCF: Higher Order Logic of Computable Functions
Sort
View
151
Voted
WCFLP
2005
ACM
15 years 6 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
197
Voted
POPL
2006
ACM
16 years 23 days ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
SYNASC
2005
IEEE
84views Algorithms» more  SYNASC 2005»
15 years 6 months ago
Membrane Computing as a Framework for Modeling Economic Processes
Abstract. This paper is a first step towards a systematic evaluation of the possibilities to use membrane computing as a modeling framework for economics. Membrane computing is a ...
Gheorghe Paun, Radu A. Paun
CIKM
2006
Springer
15 years 4 months ago
SaLSa: computing the skyline without scanning the whole sky
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
102
Voted
TOG
2002
165views more  TOG 2002»
15 years 2 days ago
CHARMS: a simple framework for adaptive simulation
Finite element solvers are a basic component of simulation applications; they are common in computer graphics, engineering, and medical simulations. Although adaptive solvers can ...
Eitan Grinspun, Petr Krysl, Peter Schröder