Sciweavers

498 search results - page 23 / 100
» An algorithm to solve integer linear systems exactly using n...
Sort
View
EMNLP
2010
13 years 5 months ago
On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
Alexander M. Rush, David Sontag, Michael Collins, ...
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 2 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
EOR
2007
78views more  EOR 2007»
13 years 7 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
MP
2002
101views more  MP 2002»
13 years 7 months ago
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
The asymptotic convergence of parameterized variants of Newton's method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a...
Nicholas I. M. Gould, Dominique Orban, Annick Sart...
ISCAS
2005
IEEE
179views Hardware» more  ISCAS 2005»
14 years 1 months ago
Robust stabilization of control systems using piecewise linear Lyapunov functions and evolutionary algorithm
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...
K. Tagawa, Y. Ohta