JAR
2011
13 years 3 months ago
2011
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
JOTA
2011
13 years 3 months ago
2011
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors a...
BC
2010
13 years 6 months ago
2010
In a noisy system, such as the nervous system, can movements be precisely controlled as experimentally demonstrated? We point out that the existing theory of motor control fails to...
EUSFLAT
2009
13 years 6 months ago
2009
Abstract-- We discuss some optimization problems for fuzzy variable functions and show two interesting results. First result is related to conditions for existence of global optima...
IMCSIT
2010
13 years 6 months ago
2010
Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ants colonies, which manage to establish the shortest route to feeding sources a...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
SIAMDM
2010
13 years 7 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
PVLDB
2010
13 years 7 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...