405 search results - page 18 / 81 » Using critical sets to solve the maximum independent set pro... |
153
Voted
ICTAI
2009
IEEE
14 years 11 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
121
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
AAAI
2006
15 years 3 months ago
2006
We present an asymptotically optimal algorithm for the max variant of the k-armed bandit problem. Given a set of k slot machines, each yielding payoff from a fixed (but unknown) d...
110
Voted
PDCAT
2005
Springer
15 years 7 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
145
Voted
IDA
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...