Sciweavers

8647 search results - page 431 / 1730
» The Container Selection Problem
Sort
View
105
Voted
MFCS
2005
Springer
15 years 10 months ago
Online and Dynamic Recognition of Squarefree Strings
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
Jesper Jansson, Zeshan Peng
155
Voted
CORR
2007
Springer
134views Education» more  CORR 2007»
15 years 4 months ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
Jochen Könemann, David Pritchard, Kunlun Tan
126
Voted
PR
2010
156views more  PR 2010»
15 years 3 months ago
The hyperbolic smoothing clustering method
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
Adilson Elias Xavier
ICML
2007
IEEE
16 years 5 months ago
On the role of tracking in stationary environments
It is often thought that learning algorithms that track the best solution, as opposed to converging to it, are important only on nonstationary problems. We present three results s...
Richard S. Sutton, Anna Koop, David Silver
140
Voted
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 4 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist