Sciweavers

3656 search results - page 45 / 732
» Compact Location Problems
Sort
View
AMC
2005
125views more  AMC 2005»
13 years 9 months ago
Wavelet multilayer Taylor Galerkin schemes for hyperbolic and parabolic problems
In this study wavelet based high-order Taylor Galerkin methods is introduced. Additional time layers are used to obtain high-order temporal accuracy unattainable within a two-step...
B. V. Rathish Kumar, Mani Mehra
JCSS
2010
146views more  JCSS 2010»
13 years 8 months ago
Connected facility location via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
DAC
2008
ACM
13 years 11 months ago
Keeping hot chips cool: are IC thermal problems hot air?
level of accuracy in IC package abstraction (compact models) to ensure robust thermal design. An overarching goal must be to reduce power consumption per function through smart pro...
Ruchir Puri, Devadas Varma, Darvin Edwards, Alan J...
COR
2002
58views more  COR 2002»
13 years 9 months ago
Fast heuristics for large scale covering-location problems
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These he...
Luce Brotcorne, Gilbert Laporte, Fréd&eacut...
INLG
2010
Springer
13 years 7 months ago
Named Entity Generation Using Sampling-based Structured Prediction
The problem of Named Entity Generation is expressed as a conditional probability model over a structured domain. By defining a factor-graph model over the mentions of a text, we o...
Guillaume Bouchard