2681 search results - page 150 / 537 » Problem F |
92
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
In the present article, we consider algebraic geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane cu...
115
click to vote
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
89
Voted
JCO
2006
15 years 21 days ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
90
Voted
SIAMDM
2008
15 years 20 days ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
97
Voted
SIAMSC
2008
15 years 20 days ago
2008
A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name "point matching method". In ...