Sciweavers

2300 search results - page 192 / 460
» Maximally Concurrent Programs
Sort
View
PLDI
2012
ACM
13 years 9 months ago
JANUS: exploiting parallelism via hindsight
This paper addresses the problem of reducing unnecessary conflicts in optimistic synchronization. Optimistic synchronization must ensure that any two concurrently executing trans...
Omer Tripp, Roman Manevich, John Field, Mooly Sagi...
EVOW
2009
Springer
16 years 1 months ago
Prediction of Interday Stock Prices Using Developmental and Linear Genetic Programming
A developmental co-evolutionary genetic programming approach (PAM DGP) is compared to a standard linear genetic programming (LGP) implementation for trading of stocks across market...
Garnett Carl Wilson, Wolfgang Banzhaf
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
16 years 19 days ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
SUM
2007
Springer
16 years 16 days ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
ISIPTA
2003
IEEE
117views Mathematics» more  ISIPTA 2003»
15 years 11 months ago
Dynamic Programming for Discrete-Time Systems with Uncertain Gain
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
Gert de Cooman, Matthias C. M. Troffaes