Sciweavers

7930 search results - page 75 / 1586
» Greedy in Approximation Algorithms
Sort
View
ACSD
2003
IEEE
102views Hardware» more  ACSD 2003»
15 years 9 months ago
Specification Coverage Aided Test Selection
In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously prese...
Tuomo Pyhälä, Keijo Heljanko
EOR
2002
84views more  EOR 2002»
15 years 6 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
15 years 11 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
MOBICOM
2006
ACM
16 years 3 days ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
SIAMSC
2010
120views more  SIAMSC 2010»
15 years 4 months ago
Simultaneously Sparse Solutions to Linear Inverse Problems with Multiple System Matrices and a Single Observation Vector
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
Adam C. Zelinski, Vivek K. Goyal, Elfar Adalsteins...