2434 search results - page 71 / 487 » Algorithmic Randomness of Closed Sets |
127
click to vote
ISCI
2008
15 years 3 months ago
2008
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
142
click to vote
WWW
2011
ACM
14 years 10 months ago
2011
ACM
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
127
click to vote
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
110
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
126
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...