Sciweavers

27

CIE
2010
Springer

110views Applied Computing» more CIE 2010»

Scalable personalization of interactive experiences through creative automation

13 years 7 months ago

Scalable personalization of interactive experiences through creative automation

Download www.cc.gatech.edu

Mark O. Riedl

claim paper

Read More »

37

CIE
2010
Springer

119views Applied Computing» more CIE 2010»

Lower Bounds for Reducibility to the Kolmogorov Random Strings

13 years 7 months 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 »

23

CIE
2010
Springer

101views Applied Computing» more CIE 2010»

Undecidability in Weihrauch Degrees

13 years 7 months ago

Undecidability in Weihrauch Degrees

Download www.iis.nsk.su

Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhu...

claim paper

Read More »

29

CF
2010
ACM

99views Applied Computing» more CF 2010»

SpiNNaker: impact of traffic locality, causality and burstiness on the performance of the interconnection network

13 years 7 months 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 »

31

COR
2011

205views Applied Computing» more COR 2011»

An exact approach to the problem of extracting an embedded network matrix

13 years 7 months 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 »

33

COR
2011

211views Applied Computing» more COR 2011»

Reduction approaches for robust shortest path problems

13 years 7 months ago

Reduction approaches for robust shortest path problems

Download homepages.ulb.ac.be

Daniele Catanzaro, Martine Labbé, Martha Sa...

claim paper

Read More »

38

COR
2011

211views Applied Computing» more COR 2011»

A Lagrangian heuristic for satellite range scheduling with resource constraints

13 years 7 months 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 »

39

COR
2011

251views Applied Computing» more COR 2011»

Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems

13 years 7 months 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 »

29

COR
2011

224views Applied Computing» more COR 2011»

Identifying and exploiting commonalities for the job-shop scheduling problem

13 years 7 months 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 »

45

COR
2011

299views Applied Computing» more COR 2011»

A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

13 years 7 months 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 »