Sciweavers

1071 search results - page 66 / 215
» Programming with enumerable sets of structures
Sort
View
POPL
2007
ACM
15 years 11 months ago
Semantics of static pointcuts in aspectJ
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...
195
Voted
CP
2009
Springer
15 years 11 months ago
Coalition Structure Generation Utilizing Compact Characteristic Function Representations
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko S...
FPCA
1995
15 years 2 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
ICRA
1999
IEEE
119views Robotics» more  ICRA 1999»
15 years 3 months ago
Programming in the Architecture for Agile Assembly
The goal of the Architecture for Agile Assembly AAA is to enable rapid deployment and recon guration of automated assembly systems through the use of cooperating, modular, robust,...
Jay Gowdy, Alfred A. Rizzi
CALCO
2005
Springer
119views Mathematics» more  CALCO 2005»
15 years 4 months ago
The Category Theoretic Solution of Recursive Program Schemes
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoret...
Stefan Milius, Lawrence S. Moss