Sciweavers

3250 search results - page 132 / 650
» An Algorithm to Solve a Linear Program
Sort
View
151
Voted
COLT
1997
Springer
15 years 9 months ago
General Convergence Results for Linear Discriminant Updates
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...
Adam J. Grove, Nick Littlestone, Dale Schuurmans
124
Voted
IOR
2008
109views more  IOR 2008»
15 years 5 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
140
Voted
AUTOMATICA
2008
118views more  AUTOMATICA 2008»
15 years 5 months ago
Optimally switched linear systems
In this paper we address the problem of optimal switching for switched linear systems. The uniqueness of our approach lies in describing the switching action by multiple control i...
Tuhin Das, Ranjan Mukherjee
HYBRID
2009
Springer
15 years 12 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
17 years 6 days ago
Fast Normalized Cut with Linear Constraints
Normalized Cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be ap...
Linli Xu (University of Alberta), Wenye Li (Univer...