Sciweavers

4103 search results - page 106 / 821
» Some results on the Collatz problem
Sort
View
MP
2002
84views more  MP 2002»
15 years 6 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...
NECO
2007
95views more  NECO 2007»
15 years 6 months ago
Support Vector Ordinal Regression
In this paper, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal...
Wei Chu, S. Sathiya Keerthi
GRAMMARS
2002
119views more  GRAMMARS 2002»
15 years 6 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
JSAT
2010
132views more  JSAT 2010»
15 years 1 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres
CORR
2011
Springer
268views Education» more  CORR 2011»
14 years 10 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene