Sciweavers

2398 search results - page 320 / 480
» Constraint Programming and Graph Algorithms
Sort
View
AOSD
2010
ACM
15 years 12 months ago
Disambiguating aspect-oriented security policies
Many software security policies can be encoded as aspects that identify and guard security-relevant program operations. Bugs in these aspectually-implemented security policies oft...
Micah Jones, Kevin W. Hamlen
ASPLOS
2010
ACM
15 years 12 months ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
CPAIOR
2005
Springer
15 years 10 months ago
The Temporal Knapsack Problem and Its Solution
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian...
JFPLC
2001
15 years 6 months ago
Recherche adaptative et contraintes musicales
We propose an environment for musical constraint solving, in the visual programming language OpenMusic. We describe an implementation of a local search algorithm, called adaptive s...
Charlotte Truchet, Carlos Agon, Gérard Assa...
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
15 years 6 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...