Sciweavers

    AAAI
    1998
    112views Intelligent Agents» more  AAAI 1998»
    "Squeaky Wheel" Optimization
    13 years 5 months ago
    "Squeaky Wheel" Optimization
    Download  www.cs.cmu.edu
    We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
    David Joslin, David P. Clements
    claim paper
    Read More »
    ACST
    2006
    234views Computer Science» more  ACST 2006»
    An efficient search algorithm for partially ordered sets
    13 years 5 months ago
    An efficient search algorithm for partially ordered sets
    Download  ds.fzu.edu.cn
    Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
    Yan Chen
    claim paper
    Read More »
    SODA
    2008
    ACM
    71views Algorithms» more  SODA 2008»
    Two-phase greedy algorithms for some classes of combinatorial linear programs
    13 years 5 months ago
    Two-phase greedy algorithms for some classes of combinatorial linear programs
    Download  grid.tsinghua.edu.cn
    We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
    Ulrich Faigle, Britta Peis
    claim paper
    Read More »
    SODA
    2008
    ACM
    128views Algorithms» more  SODA 2008»
    Analysis of greedy approximations with nonsubmodular potential functions
    13 years 5 months ago
    Analysis of greedy approximations with nonsubmodular potential functions
    Download  www.math.ucsd.edu
    In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
    Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
    claim paper
    Read More »
    LREC
    2008
    133views Education» more  LREC 2008»
    Comparing Set-Covering Strategies for Optimal Corpus Design
    13 years 5 months ago
    Comparing Set-Covering Strategies for Optimal Corpus Design
    Download  www.lrec-conf.org
    This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
    Jonathan Chevelu, Nelly Barbot, Olivier Boëff...
    claim paper
    Read More »
    CSC
    2008
    101views Applied Computing» more  CSC 2008»
    Efficient and Effective Practical Algorithms for the Set-Covering Problem
    13 years 5 months ago
    Efficient and Effective Practical Algorithms for the Set-Covering Problem
    Download  www.uwplatt.edu
    - The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
    Qi Yang, Jamie McPeek, Adam Nofsinger
    claim paper
    Read More »
    COLOGNETWENTE
    2008
    86views Optimization» more  COLOGNETWENTE 2008»
    Special Cases of Online Parallel Job Scheduling
    13 years 5 months ago
    Special Cases of Online Parallel Job Scheduling
    Download  eprints.eemcs.utwente.nl
    In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
    Johann Hurink, Jacob Jan Paulus
    claim paper
    Read More »
    GLOBECOM
    2009
    IEEE
    147views Communications» more  GLOBECOM 2009»
    A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model
    13 years 7 months ago
    A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model
    Download  www.public.asu.edu
    —In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols fo...
    Dejun Yang, Xi Fang, Nan Li, Guoliang Xue
    claim paper
    Read More »
    ESA
    2006
    Springer
    103views Algorithms» more  ESA 2006»
    Greedy in Approximation Algorithms
    13 years 8 months ago
    Greedy in Approximation Algorithms
    Download  www.mpi-inf.mpg.de
    The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
    Julián Mestre
    claim paper
    Read More »
    FCT
    2007
    Springer
    151views Applied Computing» more  FCT 2007»
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    13 years 8 months ago
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    Download  ccc.cs.uni-duesseldorf.de
    We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
    Gábor Erdélyi, Lane A. Hemaspaandra,...
    claim paper
    Read More »
    « first‹ previous1234567next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.