1449 search results - page 61 / 290 » Self-Randomized Exponentiation Algorithms |
133
click to vote
CEC
2011
IEEE
14 years 16 days ago
2011
IEEE
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
90
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
ICTCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
CPM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
103
Voted
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...