Profile Picture

Dr. Franc Brglez

Visiting Research Professor

Publications

[Keywords:] article, talk, thesis, combinatorial, optimization, search, walk, self-avoiding, asymptotic, complexity, performance, scientific method, treatment, isomorph, mutant, BDD (binary-decision-diagram), cover, unate, binate, set, graph, linear order, golomb ruler, sat, autocorrelation, taskflow, ...

[NOTE:] Reprints of class and thesis projects related to topics on this page are also included.

[2017:] Franc Brglez, Yang Ho, and Johnny Nguyen. On Asymptotic Complexity of Linear Ordering the Paley Tournament Graphs: First Prototypes with Self-Avoiding Walks, 2017. [article-draft]

[2017:] Franc Brglez, Borko Boskovic, and Janez Brest. On Asymptotic Complexity of the Optimum Golomb Ruler Problem: From Established Stochastic Methods to Self-Avoiding Walks. In Proceedings of the IEEE Congress on Evolutionary Computation, June 5-8, 2017, http://cec2017.org/ . [article]

[2017:] Borko Boskovic, Franc Brglez, and Janez Brest. Low-Autocorrelation Binary Sequences: On Improved Merit Factors and Runtime Predictions to Achieve Them. In Elsevier Journal Applied Soft Computing, 2017. See also https://arxiv.org/abs/1406.5301 [article]

[2016:] Yang Ho, Johnny Nguyen, and Franc Brglez. Linear Ordering Puzzle and Combinatorial Solvers. [A C499 class project poster]

[2016:] Johnny Nguyen, Yang Ho, and Franc Brglez. Lights-out Puzzles and Combinatorial Solvers. [A C499 class project poster]

[2013:] Franc Brglez. Self-Avoiding Walks across n-Dimensional Dice and Combinatorial Optimization: An Introduction. Informacije MIDEM, 44 (1) 2014: pp. 53-68, English Edition http://www.midem-drustvo.si/journal/ ; alternatively at http://arxiv.org/abs/1309.7508 ; An invited talk at 2013-MIDEM, Kranjska Gora, Slovenia, Sept. 2013. [article, talk]

[2011:] Franc Brglez. Of n-dimensional Dice, Combinatorial Optimization, and Reproducible Research: An Introduction. Eletrotehniski Vestnik 78(4) 2011: pp. 181–192, http://ev.fe.uni-lj.si/4-2011/Brglez.pdf . An invited talk at 2011-ERK, Portoroz, Slovenia, Sept. 2011. [article, talk]

[2008:] Franc Brglez. Experimental Computer Science: How About The Scientific Method? Invited talk, DIMACS/NISS Workshop on Experimental Analysis of Algorithms, March 2008. [talk]

[2007:] Franc Brglez and Jason A. Osborne. Performance Testing of Combinatorial Solvers With Isomorph Class Instances. In ACM-FCRC, 2007. ACM http://doi.acm.org/10.1145/1281700.1281713 . [article, talk]

[2007:] Matthias F. Stallmann and Franc Brglez. High-Contrast Algorithm Behavior: Observation, Conjecture, and Experimental Design. In ACM- FCRC, 2007. ACM http://doi.acm.org/10.1145/1281700.1281712 . [article, talk]

[2007:] Franc Brglez. On the Performance Testing of Combinatorial Optimization Algorithms: The Scientific Method. Invited talk, Mentor Graphics, June, 2007. [talk]

[2007:] Franc Brglez. On Black Box Variable Ordering (BBVO) for BDDs. Invited talk, Mentor Graphics, June, 2007. [talk]

[2005:] Franc Brglez, Xiao Y. Li, and Matthias F. Stallmann. On SAT instance classes and a method for reliable performance experiments with SAT solvers. Ann. Math. Art. Intell., 43(1):1–34, 2005. ACM http://portal. acm.org/citation.cfm?id=1036204 [article]

[2005:] Franc Brglez and Young J. Pyun. On the Use of Isomorphs to Enhance the Teaching and the Grading Methods in a Data Structures Course. Technical report, 2005. [article]

[2005:] Franc Brglez. A Presentation for David Johnson: Can We (Also) Live with Isomorphs? A talk given as part of the informal workshop on Nov. 14, 2005, during the visit by David Johnson as the Distinguished Lecturer at CS, NCSU. [talk]

[2005:] Xiao Y. Li, Matthias F. Stallmann, and Franc Brglez. Effective bounding techniques for solving unate and binate covering problems. In DAC ’05: Proceedings of the 42nd annual conference on Design Automation, pages 385–390, New York, NY, USA, 2005. ACM, http://doi.acm.org/10.1145/1065579.1065682 [article, talk]

[2004:] Franc Brglez, Xiao Y. Li, Matthias F. Stallmann, and Burkhard Militzer. Evolutionary and Alternative Algorithms: Reliable Cost Predictions for Finding Optimal Solutions to the LABS Problem. Information Sciences, 2004. [article]

[2004:] Xiao Y. Li, Matthias F. Stallmann, and Franc Brglez. A local search solver using an effective switching strategy and an efficient unit propagation. Lecture Notes in Computer Science, 2919:53–68, 2004. [article]

[2004:] Xiao Y. Li. Optimization Algorithms for the Minimum-Cost Satisfiability Problem. PhD thesis, Computer Science, North Carolina State University, Raleigh, N.C., 2004. [thesis, talk]

[2004:] Xiao Y. Li, Matthias F. Stallmann, and Franc Brglez. QingTing: A Fast SAT Solver Using Local Search and Efficient Unit Propagation. Proceedings of SAT 2003, Sixth International Symposium on the Theory and Applications of Satisfiability Testing, May 5-8 2003, S. Margherita Ligure - Portofino, Italy, 2003. [article, talk]

[2003:] Franc Brglez, Xiao Y. Li, and Matthias F. Stallmann. SATbed: An Environment For Reliable Performance Experiments with SAT Instance Classes and Algorithms. Proceedings of SAT 2003, Sixth International Symposium on the Theory and Applications of Satisfiability Testing, May 5-8 2003, S. Margherita Ligure - Portofino, Italy, 2003. [article, talk]

[2003:] Franc Brglez, Xiao Y. Li, Matthias F. Stallmann, and Burkhard Militzer. Reliable Cost Predictions for Finding Optimal Solutions to LABS Problem: Evolutionary and Alternative Algorithms. In Fifth Int. Workshop on Frontiers in Evolutionary Algorithms (FEA2003), 2003. [article, talk]

[2002:] Franc Brglez, Xiao Y. Li, and Matthias F. Stallmann. The Role of a Skeptic Agent in Testing and Benchmarking of SAT Algorithms. In Proceedings of SAT 2002, Fifth International Symposium on the Theory and Applications of Satisfiability Testing, Cincinnati, Ohio , 2002. [article]

[2001:] Justin E. Harlow III and Franc Brglez. Design of Experiments and Evaluation of BDD Ordering Heuristics. International Journal on Software Tools for Technology Transfer (STTT), 3(2):193–206, 2001. Springer-Verlag, http://www.springerlink.com/content/15en21tldhrw08nt/. [article]

[2001:] Matthias Stallmann, Franc Brglez, and Debabrata Ghosh. Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization. J. Exp. Algorithmics, ACM http://doi.acm.org/10.1145/945394.945402, 6:8, 2001. [article]

[2001:] Franc Brglez. Evaluating the Performance of Heuristics for NP-hard Problems: Are We Ready for a New Treatment? Invited talk, UC-San Diego, 2001. [talk]

[2001:] Franc Brglez. Taskflow-oriented Programming: A Method to Configure a Universal Client for Distributed Collaborative Computing. Invited talk, Cadence, 2001. [talk]

[2001:] Franc Brglez and Hemang Lavana. A Universal Client for Distributed Networked Design and Computing. In DAC ’01: Proceedings of the 38th Design Automation Conference, pages 401–406. ACM, See http://doi.acm.org/10.1145/378239.378534, 2001. [article, talk]

[2001:] Franc Brglez and Hemang Lavana. A Universal Client for Taskflow-Oriented Programming with Distributed Components: Concepts. In Proceedings of the 8th Tcl/Tk Conference at the O’Reilly Open Source Convention, ftp://ftp.oreilly.com/pub/conference/os2001/tcl_ papers/2001-TclTk-Brglez-Final.pdf, 2001. [article, talk]

[2001:] Hemang Lavana and Franc Brglez. A Universal Client for Taskflow-Oriented Programming with Distributed Components: an XML/TclTk Implementation. In Proceedings of the 8th Tcl/Tk Conference at the O’Reilly Open Source Convention, ftp://ftp.oreilly.com/pub/conference/os2001/tcl_ papers/2001-TclTk-Lavana-Final.pdf, 2001. [article, talk]

[2000:] Hemang Lavana. A Universally Configurable Architecture for Taskflow-Oriented Design of a Distributed Collaborative Computing Environment. PhD thesis, Electrical and Computer Engineering, North Carolina State University, Raleigh, N.C., 2000. [thesis]

[2000:] Debabrata Ghosh. Generation of Tightly Controlled Equivalence Classes for Experimental Design of Heuristics for Graph–Based NP- hard Problems. PhD thesis, Electrical and Computer Engineering, North Carolina State University, Raleigh, N.C., 2000. [thesis]

[2000:] Hemang Lavana and Franc Brglez. CollabWiseTk: A Toolkit for Rendering Stand-alone Applications Collaborative. In Seventh Annual Tcl/Tk Conference. USENIX, 2000. [article]

[2000:] F. Brglez, H. Lavana, Z. Fu, D. Ghosh, L. I. Moffitt, S. Nelson, J. M. Smith, and J. Zhou. Collaborative Client-Server Architectures in Tcl/Tk: A Class Project Experiment and Experience. In Seventh Annual Tcl/Tk Conference. USENIX, 2000. [article]

[1999--1969:] Franc Brglez et al. The list to cover years 1999--1969: is under construction ...

not yet completed ....