Sciweavers

79 search results - page 15 / 16
» Pareto Optimality in Abstract Argumentation
Sort
View
SAIG
2001
Springer
13 years 10 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
GLOBECOM
2010
IEEE
13 years 4 months ago
A Dynamic Framed ALOHA Scheme for Batch Resolution in Practical CSMA-Based Wireless Networks
Abstract--The batch resolution problem consists in arbitrating the channel access of a group of nodes in a wireless network in order to collect a single packet from each node in th...
Andrea Zanella
ESOP
2003
Springer
13 years 11 months ago
A Tail-Recursive Semantics for Stack Inspections
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may ha...
John Clements, Matthias Felleisen
MLG
2007
Springer
14 years 14 days ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
13 years 10 months ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum