Sciweavers

2254 search results - page 42 / 451
» Computing the minimal covering set
Sort
View
FOCS
2009
IEEE
14 years 4 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
AAAI
2006
13 years 11 months ago
Algorithms for Rationalizability and CURB Sets
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
Michael Benisch, George B. Davis, Tuomas Sandholm
CONCUR
1991
Springer
14 years 1 months ago
A Tool Set for deciding Behavioral Equivalences
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...
Jean-Claude Fernandez, Laurent Mounier
ECAI
2008
Springer
13 years 11 months ago
Generating Diagnoses from Conflict Sets with Continuous Attributes
Abstract. Many techniques in model-based diagnosis and other research fields find the hitting sets of a group of sets. Existing techniques apply to sets of finite elements only. Th...
Emmanuel Benazera, Louise Travé-Massuy&egra...
ACMSE
2007
ACM
14 years 1 months ago
Minimizing broadcast latency in ad hoc wireless networks
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
Shankar M. Banik, Sridhar Radhakrishnan