Sciweavers

698 search results - page 107 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
CSE
2009
IEEE
14 years 3 months ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings
CCS
2005
ACM
14 years 2 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 10 months ago
Integrating user preferences with particle swarms for multi-objective optimization
This paper proposes a method to use reference points as preferences to guide a particle swarm algorithm to search towards preferred regions of the Pareto front. A decision maker c...
Upali K. Wickramasinghe, Xiaodong Li
CPAIOR
2009
Springer
14 years 3 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
ECML
2001
Springer
14 years 1 months ago
A Framework for Learning Rules from Multiple Instance Data
Abstract. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is r...
Yann Chevaleyre, Jean-Daniel Zucker