Sciweavers

4843 search results - page 108 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
AAAI
1997
14 years 11 months ago
Bayes Networks for Estimating the Number of Solutions to a CSP
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
Amnon Meisels, Solomon Eyal Shimony, Gadi Solotore...
RC
1998
66views more  RC 1998»
14 years 9 months ago
An Interval Polynomial Interpolation Problem and Its Lagrange Solution
Numerical interpolation and approximation are powerful tools to solve real world application problems. To take data measurement errors into considerations of interpolating a d deg...
Chenyi Hu, Angelina Cardenas, Stephanie Hoogendoor...
ORL
1998
137views more  ORL 1998»
14 years 9 months ago
Calculation of stability radii for combinatorial optimization problems
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
Nilotpal Chakravarti, Albert P. M. Wagelmans
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 7 months ago
On Turing machines, dynamical systems and the Atiyah problem
: We consider mixed Dirichlet-Robin problems on scale irregular domains. In particular, we study the asymptotic convergence of the solutions of elliptic problems with Robin boundar...
Lukasz Grabowski
79
Voted
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 10 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang