973 search results - page 103 / 195 » New Bounds on Crossing Numbers |
158
click to vote
PPL
2007
15 years 5 months ago
2007
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
206
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
181
click to vote
CORR
2010
Springer
15 years 6 months 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 ...
170
click to vote
SIAMREV
2010
15 years 1 months ago
2010
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
159
click to vote
ICCV
2001
IEEE
16 years 8 months ago
2001
IEEE
We introduce a number of new results in the context of multi-view geometry from general algebraic curves. We start with the derivation of the extended Kruppa's equations whic...