Sciweavers

3049 search results - page 241 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CCCG
2006
15 years 8 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison
CNSM
2010
15 years 5 months ago
Near optimal demand-side energy management under real-time demand-response pricing
Abstract--In this paper, we present demand-side energy management under real-time demand-response pricing as a task scheduling problem which is NP-hard. Using minmax as the objecti...
Jin Xiao, Jae Yoon Chung, Jian Li, Raouf Boutaba, ...
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 7 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
ATMOS
2008
118views Optimization» more  ATMOS 2008»
15 years 8 months ago
Recoverable Robustness for Railway Rolling Stock Planning
Abstract. In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planni...
Valentina Cacchiani, Alberto Caprara, Laura Galli,...
COCOON
2005
Springer
16 years 22 days ago
New Streaming Algorithms for Counting Triangles in Graphs
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
Hossein Jowhari, Mohammad Ghodsi