Sciweavers

1529 search results - page 85 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
MP
2006
134views more  MP 2006»
15 years 3 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
ICSM
2006
IEEE
15 years 10 months ago
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahda...
CPAIOR
2007
Springer
15 years 10 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
SAC
2010
ACM
15 years 2 months ago
Optimal linear projections for enhancing desired data statistics
Problems involving high-dimensional data, such as pattern recognition, image analysis, and gene clustering, often require a preliminary step of dimension reduction before or durin...
Evgenia Rubinshtein, Anuj Srivastava
120
Voted
AAAI
2007
15 years 6 months ago
Improved State Estimation in Multiagent Settings with Continuous or Large Discrete State Spaces
State estimation in multiagent settings involves updating an agent’s belief over the physical states and the space of other agents’ models. Performance of the previous approac...
Prashant Doshi