2008 |
27 | EE | Csaba Attila Boer,
Arie de Bruin,
Alexander Verbraeck:
Distributed simulation in industry - a survey Part 3 - the HLA standard in industry.
Winter Simulation Conference 2008: 1094-1102 |
2006 |
26 | EE | Csaba Attila Boer,
Arie de Bruin,
Alexander Verbraeck:
Distributed simulation in industry -- a survey: part 1 -- the COTS vendors.
Winter Simulation Conference 2006: 1053-1060 |
25 | EE | Csaba Attila Boer,
Arie de Bruin,
Alexander Verbraeck:
Distributed simulation in industry -- a survey: part 2 -- experts on distributed simulation.
Winter Simulation Conference 2006: 1061-1068 |
2003 |
24 | | Arie de Bruin,
Gerard A. P. Kindervater,
Tjark Vredeveld,
Albert P. M. Wagelmans:
Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents.
Constraints 8(2): 209-218 (2003) |
2001 |
23 | EE | Wim Pijls,
Arie de Bruin:
Game tree algorithms and solution trees.
Theor. Comput. Sci. 252(1-2): 197-215 (2001) |
1998 |
22 | EE | Mark Polman,
Maarten van Steen,
Arie de Bruin:
A Structured Design Technique for Distributed Programs.
COMPSAC 1998: 308-315 |
21 | EE | Wim Pijls,
Arie de Bruin:
Game Tree Algorithms and Solution Trees.
Computers and Games 1998: 195-204 |
20 | EE | Arie de Bruin,
Shan-Hwei Nienhuys-Cheng:
Linear Dynamic Kahn Networks are Deterministic.
Theor. Comput. Sci. 195(1): 3-32 (1998) |
1997 |
19 | | Shan-Hwei Nienhuys-Cheng,
Arie de Bruin:
Kahn's Fixed-Point Characterization for Linear Dynamic Networks.
SOFSEM 1997: 513-522 |
18 | | Wim Pijls,
Arie de Bruin:
A Theory of Game Trees, Based on Solution Trees.
SOFSEM 1997: 539-546 |
1996 |
17 | | Aske Plaat,
Jonathan Schaeffer,
Wim Pijls,
Arie de Bruin:
Exploiting Graph Properties of Game Trees.
AAAI/IAAI, Vol. 1 1996: 234-239 |
16 | | Arie de Bruin,
Shan-Hwei Nienhuys-Cheng:
Linear Dynamic Kahn Networks Are Deterministic.
MFCS 1996: 242-254 |
15 | | Arie de Bruin,
Wim Pijls:
Trends in Game Tree Search.
SOFSEM 1996: 255-274 |
14 | | Arie de Bruin,
Gerard A. P. Kindervater,
Harry W. J. M. Trienekens:
Towards an abstract parallel branch and bound machine.
Solving Combinatorial Optimization Problems in Parallel 1996: 145-170 |
13 | EE | Aske Plaat,
Jonathan Schaeffer,
Wim Pijls,
Arie de Bruin:
Best-First Fixed-Depth Minimax Algorithms.
Artif. Intell. 87(1-2): 255-293 (1996) |
1995 |
12 | | Aske Plaat,
Jonathan Schaeffer,
Wim Pijls,
Arie de Bruin:
Best-First Fixed-Depth Game-Tree Search in Practice.
IJCAI 1995: 273-281 |
11 | | Arie de Bruin,
Gerard A. P. Kindervater,
Harry W. J. M. Trienekens:
Asynchronous Parallel Branch and Bound and Anomalies.
IRREGULAR 1995: 363-377 |
10 | | Roel van der Goot,
Arie de Bruin:
Syntax and Semantics of Procol.
MFCS 1995: 509-518 |
1993 |
9 | | J. W. de Bakker,
Franck van Breugel,
Arie de Bruin:
Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands.
MFCS 1993: 252-261 |
1992 |
8 | | Wim Pijls,
Arie de Bruin:
Searching Informed Game Trees.
ISAAC 1992: 332-341 |
1990 |
7 | | Arie de Bruin,
Erik P. de Vink:
Retractions in Comparing Prolog Semantics (Extended Abstract).
MFCS 1990: 180-186 |
6 | | Wim Pijls,
Arie de Bruin:
Another View on the SSS* Algorithm.
SIGAL International Symposium on Algorithms 1990: 211-220 |
1989 |
5 | | Arie de Bruin,
Erik P. de Vink:
Continuation Semantics for PROLOG with Cut.
TAPSOFT, Vol.1 1989: 178-192 |
1985 |
4 | EE | Arie de Bruin,
A. P. Wim Böhm:
The Denotational Semantics of Dynamic Networks of Processes.
ACM Trans. Program. Lang. Syst. 7(4): 656-679 (1985) |
1984 |
3 | | Arie de Bruin:
On the Existence of Cook Semantics.
SIAM J. Comput. 13(1): 1-13 (1984) |
1983 |
2 | | Job Zwiers,
Arie de Bruin,
Willem P. de Roever:
A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract).
Logic of Programs 1983: 513-527 |
1981 |
1 | | Arie de Bruin:
Goto Statements: Semantics and Deduction Systems.
Acta Inf. 15: 385-424 (1981) |