Sciweavers

9719 search results - page 228 / 1944
» Answer Set Optimization
Sort
View
CP
2003
Springer
15 years 12 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
MP
2008
82views more  MP 2008»
15 years 6 months ago
Newton's iterates can converge to non-stationary points
Abstract In this note we discuss the convergence of Newton's method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hes...
Walter F. Mascarenhas
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
16 years 14 hour ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
WSC
2008
15 years 9 months ago
Who's your Tiger? Using simulation to optimize the lineup of the Detroit Tigers offense
As part of an undergraduate engineering class project, a simulation of the Detroit Tigers offense was created to explore potential changes that would increase number of wins. More...
Jared Davis, Barbara Fordyce, James Cicala, Matthe...
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
16 years 6 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman