Sciweavers

4843 search results - page 409 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
JSAC
2008
70views more  JSAC 2008»
15 years 4 months ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping
JCO
2006
153views more  JCO 2006»
15 years 4 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
MP
2008
103views more  MP 2008»
15 years 4 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
CAD
2005
Springer
15 years 4 months ago
Industrial geometry: recent advances and applications in CAD
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...
ENDM
2010
115views more  ENDM 2010»
15 years 2 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi