36 search results - page 4 / 8 » The Universal Resolving Algorithm: Inverse Computation in a ... |
134
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
112
click to vote
SIAMREV
2011
14 years 5 months ago
2011
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
146
click to vote
CPHYSICS
2006
15 years 2 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
136
click to vote
ICTAC
2009
Springer
15 years 18 days ago
2009
Springer
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
119
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...