Sciweavers

9719 search results - page 111 / 1944
» Answer Set Optimization
Sort
View
127
Voted
DC
2010
15 years 23 days ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
90
Voted
ATAL
2004
Springer
15 years 6 months ago
Optimal Negotiation of Multiple Issues in Incomplete Information Settings
This paper studies bilateral multi-issue negotiation between self-interested agents. The outcome of such encounters depends on two key factors: the agenda (i.e., the set of issues...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
15 years 7 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
113
Voted
RSKT
2009
Springer
15 years 7 months ago
Learning Optimal Parameters in Decision-Theoretic Rough Sets
A game-theoretic approach for learning optimal parameter values for probabilistic rough set regions is presented. The parameters can be used to define approximation regions in a p...
Joseph P. Herbert, Jingtao Yao
SSPR
2004
Springer
15 years 6 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...