Sciweavers

    108
    Voted
    CIE
    2010
    Springer
    110views Applied Computing» more  CIE 2010»
    Scalable personalization of interactive experiences through creative automation
    15 years 1 days ago
    Scalable personalization of interactive experiences through creative automation
    Download  www.cc.gatech.edu
    Mark O. Riedl
    claim paper
    Read More »
    152
    Voted
    CIE
    2010
    Springer
    119views Applied Computing» more  CIE 2010»
    Lower Bounds for Reducibility to the Kolmogorov Random Strings
    15 years 1 days ago
    Lower Bounds for Reducibility to the Kolmogorov Random Strings
    Download  www.cs.uwyo.edu
    Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.
    John M. Hitchcock
    claim paper
    Read More »
    108
    Voted
    CIE
    2010
    Springer
    101views Applied Computing» more  CIE 2010»
    Undecidability in Weihrauch Degrees
    15 years 1 days ago
    Undecidability in Weihrauch Degrees
    Download  www.iis.nsk.su
    Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhu...
    claim paper
    Read More »
    CF
    2010
    ACM
    99views Applied Computing» more  CF 2010»
    SpiNNaker: impact of traffic locality, causality and burstiness on the performance of the interconnection network
    15 years 1 days ago
    SpiNNaker: impact of traffic locality, causality and burstiness on the performance of the interconnection network
    Download  www.cs.man.ac.uk
    Javier Navaridas, Luis A. Plana, José Migue...
    claim paper
    Read More »
    144
    Voted
    COR
    2011
    205views Applied Computing» more  COR 2011»
    An exact approach to the problem of extracting an embedded network matrix
    15 years 1 days ago
    An exact approach to the problem of extracting an embedded network matrix
    Download  www.optimization-online.org
    Rosa M. V. Figueiredo, Martine Labbé, Cid C...
    claim paper
    Read More »
    141
    Voted
    COR
    2011
    211views Applied Computing» more  COR 2011»
    Reduction approaches for robust shortest path problems
    15 years 1 days ago
    Reduction approaches for robust shortest path problems
    Download  homepages.ulb.ac.be
    Daniele Catanzaro, Martine Labbé, Martha Sa...
    claim paper
    Read More »
    161
    Voted
    COR
    2011
    211views Applied Computing» more  COR 2011»
    A Lagrangian heuristic for satellite range scheduling with resource constraints
    15 years 1 days ago
    A Lagrangian heuristic for satellite range scheduling with resource constraints
    Download  www.optimization-online.org
    The task of scheduling communications between satellites and ground control stations is getting more and more critical since an increasing number of satellites must be controlled ...
    Fabrizio Marinelli, Salvatore Nocella, Fabrizio Ro...
    claim paper
    Read More »
    157
    Voted
    COR
    2011
    251views Applied Computing» more  COR 2011»
    Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems
    15 years 1 days ago
    Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems
    Download  www.upv.es
    Gerardo Minella, Rubén Ruiz, Michele Ciavot...
    claim paper
    Read More »
    136
    Voted
    COR
    2011
    224views Applied Computing» more  COR 2011»
    Identifying and exploiting commonalities for the job-shop scheduling problem
    15 years 1 days ago
    Identifying and exploiting commonalities for the job-shop scheduling problem
    Download  www.cs.uu.nl
    Marnix Kammer, Marjan van den Akker, Han Hoogeveen
    claim paper
    Read More »
    175
    Voted
    COR
    2011
    299views Applied Computing» more  COR 2011»
    A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
    15 years 1 days ago
    A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
    Download  www.optimization-online.org
    : In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
    Kerem Bülbül
    claim paper
    Read More »
    « first‹ previous…535455565758596061…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.