Sciweavers

499 search results - page 61 / 100
» Multilevel algorithms for linear ordering problems
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
IPL
2010
114views more  IPL 2010»
13 years 6 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
SIGIR
2004
ACM
14 years 1 months ago
Learning effective ranking functions for newsgroup search
Web communities are web virtual broadcasting spaces where people can freely discuss anything. While such communities function as discussion boards, they have even greater value as...
Wensi Xi, Jesper Lind, Eric Brill
FM
2009
Springer
169views Formal Methods» more  FM 2009»
13 years 11 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...