Sciweavers

7167 search results - page 296 / 1434
» Answer Set Programming
Sort
View
135
Voted
ICML
2003
IEEE
16 years 3 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
ESORICS
2005
Springer
15 years 8 months ago
Enforcing Non-safety Security Policies with Program Monitors
We consider the enforcement powers of program monitors, which intercept security-sensitive actions of a target application at run time and take remedial steps whenever the target a...
Jay Ligatti, Lujo Bauer, David Walker
112
Voted
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
15 years 8 months ago
Genetic programming: parametric analysis of structure altering mutation techniques
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...
Alan Piszcz, Terence Soule
108
Voted
MICRO
2003
IEEE
155views Hardware» more  MICRO 2003»
15 years 8 months ago
Comparing Program Phase Detection Techniques
Detecting program phase changes accurately is an important aspect of dynamically adaptable systems. Three dynamic program phase detection techniques are compared – using instruc...
Ashutosh S. Dhodapkar, James E. Smith
121
Voted
LOPSTR
1994
Springer
15 years 6 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher