Sciweavers

171 search results - page 12 / 35
» Searching for a Solution to Program Verification=Equation So...
Sort
View
CCS
2008
ACM
13 years 9 months ago
Efficient and extensible security enforcement using dynamic data flow analysis
Current taint tracking systems suffer from high overhead and a lack of generality. In this paper, we solve both of these issues with an extensible system that is an order of magni...
Walter Chang, Brandon Streiff, Calvin Lin
NMA
2010
13 years 5 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
ATAL
2007
Springer
14 years 1 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 1 months ago
Exploring extended particle swarms: a genetic programming approach
Particle Swarm Optimisation (PSO) uses a population of particles that fly over the fitness landscape in search of an optimal solution. The particles are controlled by forces tha...
Riccardo Poli, Cecilia Di Chio, William B. Langdon
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
14 years 29 days ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow