Sciweavers

7200 search results - page 1215 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
ENTCS
2010
75views more  ENTCS 2010»
13 years 10 months ago
A Lightweight Approach to Customizable Composition Operators for Java-like Classes
We propose a formal framework for extending a class-based language, equipped with a given class composition mechanism, to allow programmers to define their own derived composition...
Giovanni Lagorio, Marco Servetto, Elena Zucca
AIL
2006
84views more  AIL 2006»
13 years 10 months ago
Meaningful electronic signatures based on an automatic indexing method
Legal information certification and secured storage combined with documents electronic signature are of great interest when digital documents security and conservation are in conce...
Maxime Wack, Ahmed Nait-Sidi-Moh, Sid Lamrous, Nat...
EJC
2008
13 years 10 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
ENTCS
2008
106views more  ENTCS 2008»
13 years 10 months ago
Reduction Semantics and Formal Analysis of Orc Programs
Orc is a language for orchestration of web services developed by J. Misra that offers simple, yet powerful and elegant, constructs to program sophisticated web orchestration appli...
Musab AlTurki, José Meseguer
CL
2006
Springer
13 years 10 months ago
Inter-language reflection: A conceptual model and its implementation
Meta programming is the act of reasoning about a computational system. For example, a program in Prolog can reason about a program written in Smalltalk. Reflection is a more power...
Kris Gybels, Roel Wuyts, Stéphane Ducasse, ...
« Prev « First page 1215 / 1440 Last » Next »