Sciweavers

130 search results - page 11 / 26
» Exact Algorithms for Exact Satisfiability and Number of Perf...
Sort
View
CSI
2006
136views more  CSI 2006»
13 years 7 months ago
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
STOC
2000
ACM
123views Algorithms» more  STOC 2000»
13 years 11 months ago
List decoding algorithms for certain concatenated codes
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
Venkatesan Guruswami, Madhu Sudan
TSP
2008
132views more  TSP 2008»
13 years 7 months ago
Robust Intervention in Probabilistic Boolean Networks
Probabilistic Boolean networks (PBNs) have been recently introduced as a paradigm for modeling genetic regulatory networks. One of the objectives of PBN modeling is to use the netw...
Ranadip Pal, Aniruddha Datta, Edward R. Dougherty
ICALP
2005
Springer
14 years 1 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 7 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...