Sciweavers

16843 search results - page 157 / 3369
» On Generalized Authorization Problems
Sort
View
JGAA
2000
179views more  JGAA 2000»
15 years 4 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
212
Voted
CP
1995
Springer
15 years 8 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
108
Voted
WCE
2007
15 years 6 months ago
Solution of Supersonic Internal Flow Problems Using MFDV
— The FDV method was originally developed by T.J. Chung [3]-[6]. The authors developed and presented a modification to this method named MFDV method in [2]. The aim of this modif...
A. A. Megahed, M. W. El-Mallah, B. R. Girgis
EOR
2008
93views more  EOR 2008»
15 years 5 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
ECCC
2011
234views ECommerce» more  ECCC 2011»
14 years 12 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan