Sciweavers

1165 search results - page 10 / 233
» Effective linear programming based placement methods
Sort
View
TASE
2010
IEEE
13 years 2 months ago
Sensor Placement for Triangulation-Based Localization
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
Onur Tekdas, Volkan Isler
IPPS
1996
IEEE
13 years 11 months ago
Resource Placement in Torus-Based Networks
This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost / performance tradeoffs in a torus p...
Myung M. Bae, Bella Bose
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 7 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
ICAL
2011
301views more  ICAL 2011»
12 years 7 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...
DAC
2001
ACM
14 years 8 months ago
Improved Cut Sequences for Partitioning Based Placement
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
Mehmet Can Yildiz, Patrick H. Madden