Sciweavers

502 search results - page 73 / 101
» Monotone Approximation of Decision Problems
Sort
View
88
Voted
FOCS
2009
IEEE
15 years 4 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
15 years 10 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
AUSAI
2005
Springer
15 years 3 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb
AAAI
2007
14 years 12 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
72
Voted
EUSFLAT
2007
170views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
Inverse Arithmetic Operators for Fuzzy Intervals
Fuzzy arithmetic is a powerful tool in many engineering problems such as decision making, control theory, fuzzy systems and approximate reasoning. However, it is well known that t...
Reda Boukezzoula, Sylvie Galichet, Laurent Foulloy