Sciweavers

1333 search results - page 61 / 267
» Not a Number of Floating Point Problems
Sort
View
122
Voted
IPL
2008
97views more  IPL 2008»
15 years 3 months ago
Dynamic polar diagram
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
Bahram Sadeghi Bigham, Ali Mohades, Lidia M. Orteg...
108
Voted
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
15 years 5 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
131
Voted
COLT
1999
Springer
15 years 7 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
165
Voted
SIAMSC
2008
179views more  SIAMSC 2008»
15 years 3 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros
145
Voted
MP
2006
138views more  MP 2006»
15 years 3 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...