Sciweavers

111 search results - page 4 / 23
» Finding Total Unimodularity in Optimization Problems Solved ...
Sort
View
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
14 years 1 days ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
DIS
2010
Springer
13 years 4 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 19 days ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
GIS
2011
ACM
12 years 9 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
NETCOOP
2007
Springer
14 years 5 days ago
Minimum Transmission Energy Trajectories for a Linear Pursuit Problem
In this paper we study a pursuit problem in the context of a wireless sensor network, where the pursuer (i.e., mobile sink) trying to capture a pursuee (i.e., tracked object), movi...
Attila Vidács, Jorma T. Virtamo