7228 search results - page 311 / 1446 » From Algorithmic to Subjective Randomness |
113
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
We present a flexible new optimization framework for finding effective, reliable pseudo-relevance feedback models that unifies existing complementary approaches in a principled wa...
136
click to vote
DAC
2008
ACM
16 years 5 months ago
2008
ACM
In this paper we present a reconfigurable routing algorithm for a 2D-Mesh Network-on-Chip (NoC) dedicated to faulttolerant, Massively Parallel Multi-Processors Systems on Chip (MP...
143
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
130
click to vote
TAPIA
2003
ACM
15 years 10 months ago
2003
ACM
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
142
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...