Sciweavers

405 search results - page 18 / 81
» Using critical sets to solve the maximum independent set pro...
Sort
View
ICTAI
2009
IEEE
13 years 5 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
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...
Cédric Pinto, Cyril Terrioux
GLOBECOM
2007
IEEE
14 years 2 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—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...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
AAAI
2006
13 years 9 months ago
An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
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...
Matthew J. Streeter, Stephen F. Smith
PDCAT
2005
Springer
14 years 1 months ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
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...
Jun Wang, Min Song
IDA
2009
Springer
13 years 5 months ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
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...
Peter Gruber, Harold W. Gutch, Fabian J. Theis