Sciweavers

867 search results - page 68 / 174
» The Generalized Maximum Coverage Problem
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
Scheduling for small delay in multi-rate multi-channel wireless networks
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 8 months ago
Subclose Families, Threshold Graphs, and the Weight Hierarchy of Grassmann and Schubert Codes
Abstract. We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert va...
Sudhir R. Ghorpade, Arunkumar R. Patil, Harish K. ...
ACL
1989
13 years 9 months ago
Evaluating Discourse Processing Algorithms
In order to take steps towards establishing a methodology for evaluating Natural Language systems, we conducted a case study. We attempt to evaluate two different approaches to an...
Marilyn A. Walker
GECCO
2007
Springer
234views Optimization» more  GECCO 2007»
14 years 2 months ago
Applying particle swarm optimization to software testing
Evolutionary structural testing is an approach to automatically generating test cases that achieve high structural code coverage. It typically uses genetic algorithms (GAs) to sea...
Andreas Windisch, Stefan Wappler, Joachim Wegener
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...