Sciweavers

1333 search results - page 32 / 267
» Not a Number of Floating Point Problems
Sort
View
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 2 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
111
Voted
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 4 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
14 years 7 months ago
A fast well-conditioned interior point method for predictive control
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
Amir Shahzad, Eric C. Kerrigan, George A. Constant...
STACS
2009
Springer
15 years 5 months ago
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
Mahdi Cheraghchi, Amin Shokrollahi
103
Voted
SAC
2006
ACM
15 years 6 months ago
Towards a model-driven join point model
Aspect–Oriented Programming (AOP) is increasingly being adopted by developers to better modularize object–oriented design by introducing crosscutting concerns. However, due to...
Walter Cazzola, Antonio Cicchetti, Alfonso Pierant...