Sciweavers

2569 search results - page 65 / 514
» Approximate Objects and Approximate Theories
Sort
View
DAM
2008
111views more  DAM 2008»
14 years 12 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
TALG
2010
110views more  TALG 2010»
14 years 10 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
ICRA
1998
IEEE
118views Robotics» more  ICRA 1998»
15 years 4 months ago
A General Theory for Positioning and Orienting 2D Polygonal or Curved Parts using Intelligent Motion Surfaces
: In this paper we present novel algorithms to compute quasi-static and dynamic equilibrium positions and orientations (if any) of 2D polygonal or curved parts placed on general sh...
Murilo G. Coutinho, Peter M. Will
AMC
2011
14 years 3 months ago
Ruin theory with excess of loss reinsurance and reinstatements
The present paper studies the probability of ruin of an insurer, if excess of loss reinsurance with reinstatements is applied. In the setting of the classical CramerLundberg risk ...
Hansjörg Albrecher, Sandra Haas
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 5 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang