Sciweavers

621 search results - page 103 / 125
» An Expressive and Efficient Solution to the Service Selectio...
Sort
View
IJISEC
2006
106views more  IJISEC 2006»
14 years 9 months ago
Execution transactions for defending against software failures: use and evaluation
We examine the problem of containing buffer overflow attacks in a safe and efficient manner. Briefly, we automatically augment source code to dynamically catch stack and heap-based...
Stelios Sidiroglou, Angelos D. Keromytis
AAAI
2006
14 years 11 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
PKDD
2000
Springer
107views Data Mining» more  PKDD 2000»
15 years 1 months ago
Expert Constrained Clustering: A Symbolic Approach
Abstract. A new constrained model is discussed as a way of incorporating efficiently a priori expert knowledge into a clustering problem of a given individual set. The first innova...
Fabrice Rossi, Frédérick Vautrain
ATAL
2010
Springer
14 years 10 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
CGF
2008
126views more  CGF 2008»
14 years 9 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar