Radu Marinescu

University of California, Irvine

other persons with the same name:

• Radu Marinescu - University of Timisoara

	2009
13		Radu Marinescu, Rina Dechter: AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1457-1491 (2009)
12		Radu Marinescu, Rina Dechter: Memory intensive AND/OR search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1492-1524 (2009)
	2008
11		Rina Dechter, Lars Otten, Radu Marinescu: On the Practical Significance of Hypertree vs. TreeWidth. ECAI 2008: 913-914
10		Robert Mateescu, Rina Dechter, Radu Marinescu: AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. J. Artif. Intell. Res. (JAIR) 33: 465-519 (2008)
	2007
9		Radu Marinescu, Rina Dechter: Best-First AND/OR Search for Graphical Models. AAAI 2007: 1171-1176
8		Robert Mateescu, Radu Marinescu, Rina Dechter: AND/OR Multi-valued Decision Diagrams for Constraint Optimization. CP 2007: 498-513
7		Radu Marinescu, Rina Dechter: Best-First AND/OR Search for 0/1 Integer Programming. CPAIOR 2007: 171-185
	2006
6		Radu Marinescu, Rina Dechter: Memory Intensive Branch-and-Bound Search for Graphical Models. AAAI 2006
5		Radu Marinescu, Rina Dechter: AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. CPAIOR 2006: 152-166
4		Radu Marinescu, Rina Dechter: Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. ECAI 2006: 138-142
	2005
3		Radu Marinescu, Rina Dechter: AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. CP 2005: 857
2		Radu Marinescu, Rina Dechter: AND/OR Branch-and-Bound for Graphical Models. IJCAI 2005: 224-229
	2003
1		Radu Marinescu, Kalev Kask, Rina Dechter: Systematic vs. Non-systematic Algorithms for Solving the MPE Task. UAI 2003: 394-402

Coauthor Index

1	Rina Dechter	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13]
2	Kalev Kask	[1]
3	Robert Mateescu	[8] [10]
4	Lars Otten	[11]