Arie de Bruin - RankMe

39 papers A* 1B 9Misc 3Journal 17Unranked 8

Year	Rank	Type	Title / Venue / Authors
2017	J	`jnl`	A Minimax Algorithm Better Than Alpha-beta?: No and Yes. CoRR Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
2015	J	`jnl`	Best-First and Depth-First Minimax Search in Practice. CoRR Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
2014	J	`jnl`	A New Paradigm for Minimax Search. CoRR Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
2014	J	`jnl`	Nearly Optimal Minimax Tree Search? CoRR Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
2014	J	`jnl`	SSS* = Alpha-Beta + TT. CoRR Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
2009	J	`jnl`	A survey on distributed simulation in industry. J. Simulation Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck
2008	Misc	`conf`	Distributed simulation in industry - a survey Part 3 - the HLA standard in industry. WSC Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck
2006	Misc	`conf`	Distributed simulation in industry - a survey: part 1 - the COTS vendors. WSC Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck
2006	Misc	`conf`	Distributed simulation in industry - a survey: part 2 - experts on distributed simulation. WSC Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck
2003	J	`jnl`	Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents. Constraints An Int. J. Arie de Bruin, Gerard A. P. Kindervater, Tjark Vredeveld, Albert P. M. Wagelmans
2001	J	`jnl`	Game tree algorithms and solution trees. Theor. Comput. Sci. Wim Pijls, Arie de Bruin
1998	B	`conf`	A Structured Design Technique for Distributed Programs. COMPSAC Mark Polman, Maarten van Steen, Arie de Bruin
1998	—	`conf`	Game Tree Algorithms and Solution Trees. Computers and Games Wim Pijls, Arie de Bruin
1998	J	`jnl`	Linear Dynamic Kahn Networks are Deterministic. Theor. Comput. Sci. Arie de Bruin, Shan-Hwei Nienhuys-Cheng
1997	B	`conf`	A Theory of Game Trees, Based on Solution Trees. SOFSEM Wim Pijls, Arie de Bruin
1997	—	`conf`	Formalizing a Design Technique for Distributed Programs. PDSE Mark Polman, Maarten van Steen, Arie de Bruin
1997	B	`conf`	Kahn's Fixed-Point Characterization for Linear Dynamic Networks. SOFSEM Shan-Hwei Nienhuys-Cheng, Arie de Bruin
1996	J	`jnl`	Best-First Fixed-Depth Minimax Algorithms (Abstract Only). ICCA J. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
1996	J	`jnl`	Best-First Fixed-Depth Minimax Algorithms. Artif. Intell. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
1996	—	`conf`	Exploiting Graph Properties of Game Trees. AAAI/IAAI, Vol. 1 Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
1996	B	`conf`	Linear Dynamic Kahn Networks Are Deterministic. MFCS Arie de Bruin, Shan-Hwei Nienhuys-Cheng
1996	—	`conf`	Towards an abstract parallel branch and bound machine. Solving Combinatorial Optimization Problems in Parallel Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens
1996	B	`conf`	Trends in Game Tree Search. SOFSEM Arie de Bruin, Wim Pijls
1995	—	`conf`	Asynchronous Parallel Branch and Bound and Anomalies. IRREGULAR Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens
1995	A*	`conf`	Best-First Fixed-Depth Game-Tree Search in Practice. IJCAI Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
1995	B	`conf`	Syntax and Semantics of Procol. MFCS Roel van der Goot, Arie de Bruin
1994	J	`jnl`	Solution Trees as a Basis for Game-Tree Search. ICCA J. Arie de Bruin, Wim Pijls, Aske Plaat
1993	B	`conf`	Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands. MFCS J. W. de Bakker, Franck van Breugel, Arie de Bruin
1993	J	`jnl`	SSS*-Like Algorithms in Constrained Memory. ICCA J. Wim Pijls, Arie de Bruin
1992	B	`conf`	Searching Informed Game Trees. ISAAC Wim Pijls, Arie de Bruin
1990	—	`conf`	Another View on the SSS SIGAL International Symposium on Algorithms Wim Pijls, Arie de Bruin
1990	B	`conf`	Retractions in Comparing Prolog Semantics (Extended Abstract). MFCS Arie de Bruin, Erik P. de Vink
1989	—	`conf`	Continuation Semantics for PROLOG with Cut. TAPSOFT, Vol.1 Arie de Bruin, Erik P. de Vink
1988	J	`jnl`	A simulation tool for the performance evaluation of parallel branch and bound algorithms. Math. Program. Arie de Bruin, Alexander H. G. Rinnooy Kan, Harry W. J. M. Trienekens
1985	J	`jnl`	The Denotational Semantics of Dynamic Networks of Processes. ACM Trans. Program. Lang. Syst. Arie de Bruin, A. P. Wim Böhm
1984	J	`jnl`	On the Existence of Cook Semantics. SIAM J. Comput. Arie de Bruin
1983	—	`conf`	A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract). Logic of Programs Job Zwiers, Arie de Bruin, Willem P. de Roever
1981	J	`jnl`	Goto Statements: Semantics and Deduction Systems. Acta Informatica Arie de Bruin
1980	—	`book`	Mathematical theory of program correctness. Jacobus W. de Bakker, Arie de Bruin, Jeffrey Zucker