Sciweavers

497 search results - page 48 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
15 years 1 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
ICS
2003
Tsinghua U.
15 years 3 months ago
Estimating cache misses and locality using stack distances
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
Calin Cascaval, David A. Padua
EVOW
2006
Springer
15 years 1 months ago
The Core Concept for the Multidimensional Knapsack Problem
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
Jakob Puchinger, Günther R. Raidl, Ulrich Pfe...
ADHOCNOW
2004
Springer
15 years 3 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
SIAMIS
2010
378views more  SIAMIS 2010»
14 years 4 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert