Arie de Bruin

According to our database, Arie de Bruin authored at least 36 papers between 1980 and 2017.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2017

A Minimax Algorithm Better Than Alpha-beta?: No and Yes.

Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin

CoRR, 2017

2015

Best-First and Depth-First Minimax Search in Practice.

Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin

CoRR, 2015

2014

Nearly Optimal Minimax Tree Search?

Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin

CoRR, 2014

SSS* = Alpha-Beta + TT.

Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin

CoRR, 2014

A New Paradigm for Minimax Search.

Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin

CoRR, 2014

2009

A survey on distributed simulation in industry.

Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck

J. Simulation, 2009

2008

Distributed simulation in industry - a survey Part 3 - the HLA standard in industry.

Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck

Proceedings of the 2008 Winter Simulation Conference, Global Gateway to Discovery, 2008

2006

Distributed simulation in industry - a survey: part 2 - experts on distributed simulation.

Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck

Proceedings of the Winter Simulation Conference WSC 2006, 2006

Distributed simulation in industry - a survey: part 1 - the COTS vendors.

Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck

Proceedings of the Winter Simulation Conference WSC 2006, 2006

2003

Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents.

Arie de Bruin, Gerard A. P. Kindervater, Tjark Vredeveld, Albert P. M. Wagelmans

Constraints An Int. J., 2003

2001

Game tree algorithms and solution trees.

Wim Pijls, Arie de Bruin

Theor. Comput. Sci., 2001

1998

Linear Dynamic Kahn Networks are Deterministic.

Arie de Bruin, Shan-Hwei Nienhuys-Cheng

Theor. Comput. Sci., 1998

A Structured Design Technique for Distributed Programs.

Mark Polman, Maarten van Steen, Arie de Bruin

Proceedings of the COMPSAC '98, 1998

1997

A Theory of Game Trees, Based on Solution Trees.

Wim Pijls, Arie de Bruin

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Kahn's Fixed-Point Characterization for Linear Dynamic Networks.

Shan-Hwei Nienhuys-Cheng, Arie de Bruin

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Formalizing a Design Technique for Distributed Programs.

Mark Polman, Maarten van Steen, Arie de Bruin

Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems, 1997

1996

Best-First Fixed-Depth Minimax Algorithms.

Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin

Artif. Intell., 1996

Trends in Game Tree Search.

Arie de Bruin, Wim Pijls

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Towards an abstract parallel branch and bound machine.

Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens

Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

Exploiting Graph Properties of Game Trees.

Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Syntax and Semantics of Procol.

Roel van der Goot, Arie de Bruin

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Asynchronous Parallel Branch and Bound and Anomalies.

Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

Best-First Fixed-Depth Game-Tree Search in Practice.

Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994

Solution Trees as a Basis for Game-Tree Search.

Arie de Bruin, Wim Pijls, Aske Plaat

J. Int. Comput. Games Assoc., 1994

1993

SSS*-Like Algorithms in Constrained Memory.

Wim Pijls, Arie de Bruin

J. Int. Comput. Games Assoc., 1993

Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands.

J. W. de Bakker, Franck van Breugel, Arie de Bruin

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

Searching Informed Game Trees.

Wim Pijls, Arie de Bruin

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1990

Another View on the SSS^* Algorithm.

Wim Pijls, Arie de Bruin

Proceedings of the Algorithms, 1990

Retractions in Comparing Prolog Semantics (Extended Abstract).

Arie de Bruin, Erik P. de Vink

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

Continuation Semantics for PROLOG with Cut.

Arie de Bruin, Erik P. de Vink

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

1988

A simulation tool for the performance evaluation of parallel branch and bound algorithms.

Arie de Bruin, Alexander H. G. Rinnooy Kan, Harry W. J. M. Trienekens

Math. Program., 1988

1985

The Denotational Semantics of Dynamic Networks of Processes.

Arie de Bruin, A. P. Wim Böhm

ACM Trans. Program. Lang. Syst., 1985

1984

On the Existence of Cook Semantics.

Arie de Bruin

SIAM J. Comput., 1984

1983

A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract).

Job Zwiers, Arie de Bruin, Willem P. de Roever

Proceedings of the Logics of Programs, 1983

1981

Goto Statements: Semantics and Deduction Systems.

Arie de Bruin

Acta Informatica, 1981

1980

Mathematical theory of program correctness.

Jacobus W. de Bakker, Arie de Bruin, Jeffrey Zucker

Prentice-Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-562132-5, 1980