Sciweavers

6315 search results - page 76 / 1263
» Approximating Solution Structure
Sort
View
97
Voted
MOC
2000
73views more  MOC 2000»
15 years 2 months ago
Korovkin tests, approximation, and ergodic theory
We consider sequences of s
Stefano Serra Capizzano
113
Voted
VLSID
2004
IEEE
111views VLSI» more  VLSID 2004»
16 years 3 months ago
On Buffering Schemes for Long Multi-Layer Nets
We consider the problem of minimizing the delay in signal transmission over point-to-point connections across multiple metal layers in a VLSI circuit. We present an exact solution...
Vani Prasad, Madhav P. Desai
163
Voted
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 8 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
157
Voted
AIPS
2009
15 years 3 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
109
Voted
FUIN
2010
112views more  FUIN 2010»
15 years 1 months ago
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
Luca Pulina, Armando Tacchella