Shun-Shii Lin

According to our database1, Shun-Shii Lin authored at least 38 papers between 1994 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
JadeHare wins Honeymoon Bridge tournament in ICGA 2022.
J. Int. Comput. Games Assoc., 2022

Monte_Alpha Wins the EinStein Würfelt Nicht Tournament.
J. Int. Comput. Games Assoc., 2022

2020
Jump wins Chinese Checkers tournament.
J. Int. Comput. Games Assoc., 2020

Requiem wins Nonogram tournament.
J. Int. Comput. Games Assoc., 2020

2019
A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments.
J. Int. Comput. Games Assoc., 2019

2018
Design and implementation aspects of a Surakarta program.
J. Int. Comput. Games Assoc., 2018

Some improvements in Monte Carlo tree search algorithms for sudden death games.
J. Int. Comput. Games Assoc., 2018

2017
An algorithmic design and implementation of outer-open gomoku.
Proceedings of the 2nd International Conference on Computer and Communication Systems, 2017

2014
TCGA 2014 Computer Game Tournament.
J. Int. Comput. Games Assoc., 2014

2013
LONGCAT Wins Mahjong Tournament.
J. Int. Comput. Games Assoc., 2013

2012
Fault-tolerant Gaussian normal basis multiplier over GF(2<sup>m</sup>).
IET Inf. Secur., 2012

Palindromic-like representation for Gaussian normal basis multiplier over GF(2<sup>m</sup>) with odd type t.
IET Inf. Secur., 2012

2011
The Transitive Closure and Related Algorithms of Digraph on the Reconfigurable Architecture.
Parallel Process. Lett., 2011

Self-checking alternating logic bit-parallel gaussian normal basis multiplier with type-t.
IET Inf. Secur., 2011

2010
The Analysis of a Self-stabilizing MAC Protocol for Multi-channel Ad Hoc Networks.
J. Networks, 2010

Monte-Carlo Simulation Balancing Applied to 9x9 Go.
J. Int. Comput. Games Assoc., 2010

Monte-Carlo Simulation Balancing in Practice.
Proceedings of the Computers and Games - 7th International Conference, 2010

2009
The Analysis of a Multi-channel MAC Protocol Using Maximal Matching for Ad Hoc Networks.
Proceedings of the International Conference on Networked Computing and Advanced Information Management, 2009

Optimal Analyses for 3×<i>n</i> AB Games in the Worst Case.
Proceedings of the Advances in Computer Games, 12th International Conference, 2009

2008
Schedulability issues for EDZL scheduling on real-time multiprocessor systems.
Inf. Process. Lett., 2008

2007
An Efficient Approach to Solve Mastermind Optimally.
J. Int. Comput. Games Assoc., 2007

Strategy optimization for deductive games.
Eur. J. Oper. Res., 2007

A Two-Phase Optimization Algorithm For Mastermind.
Comput. J., 2007

Current Results on EDZL Scheduling for Multiprocessor Real-Time Systems.
Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 2007

2006
Exact-Bound Analyzes and Optimal Strategies for Mastermind with a Lie.
Proceedings of the Advances in Computer Games, 11th International Conference, 2006

2005
Optimal algorithms for constructing knight's tours on arbitrary <i>n</i>?<i>m</i> chessboards.
Discret. Appl. Math., 2005

2004
Optimal Algorithms for 2xn AB Games - A Graph-Partition Approach.
J. Inf. Sci. Eng., 2004

Towards the Exact Minimization of BDDs-An Elitism-Based Distributed Evolutionary Algorithm.
J. Heuristics, 2004

Optimal Algorithms for 2 [times] n Mastermind Games-a Graph-Partition Approach.
Comput. J., 2004

A Multi-Channel MAC Protocol Using Maximal Matching for Ad Hoc.
Proceedings of the 24th International Conference on Distributed Computing Systems Workshops (ICDCS 2004 Workshops), 2004

2002
Constant-time Algorithms for Minimum Spanning Tree and Related Problems on Processor Array with Reconfigurable Bus Systems.
Comput. J., 2002

1998
Pfair Scheduling of Generalized Pinwheel Task Systems.
IEEE Trans. Computers, 1998

On Detecting Multiple Faults in Baseline Interconnection Networks.
Comput. J., 1998

1997
A low-cost neural sorting network with O(1) time complexity.
Neurocomputing, 1997

A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound.
Algorithmica, 1997

Improved scheduling of generalized pinwheel task systems.
Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications (RTCSA '97), 1997

1994
Constant-time algorithms for the channel assignment problem on processor arrays with reconfigurable bus systems.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994

Pinwheel scheduling with three distinct numbers.
Proceedings of the Sixth Euromicro Workshop on Real-Time Systems, 1994


  Loading...