Sciweavers

1301 search results - page 48 / 261
» Bounded Version Vectors
Sort
View
MP
2006
137views more  MP 2006»
15 years 3 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
AUTOMATICA
2004
113views more  AUTOMATICA 2004»
15 years 3 months ago
Ellipsoidal bounds for uncertain linear equations and dynamical systems
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
Giuseppe Carlo Calafiore, Laurent El Ghaoui
WINE
2009
Springer
140views Economy» more  WINE 2009»
15 years 10 months ago
Tighter Bounds for Facility Games
In one dimensional facility games, public facilities are placed based on the reported locations of the agents, where all the locations of agents and facilities are on a real line. ...
Pinyan Lu, Yajun Wang, Yuan Zhou
SAT
2007
Springer
99views Hardware» more  SAT 2007»
15 years 10 months ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...
138
Voted
COLT
1995
Springer
15 years 7 months ago
On Learning Bounded-Width Branching Programs
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld