Works (7)

Updated: April 4th, 2024 23:47

2007 conference paper

High-contrast algorithm behavior

Proceedings of the 2007 workshop on Experimental computer science - ExpCS '07. Presented at the the 2007 workshop.

By: M. Stallmann n & F. Brglez n

Event: the 2007 workshop

Sources: Crossref, NC State University Libraries
Added: March 23, 2020

2004 chapter

A Local search sat solver using an effective switching strategy and an efficient unit propagation

In Theory and applications of satisfiability testing: 6th International Conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003, Selected revised papers (Vol. 2919, pp. 53–68). Berlin; New York: Springer.

By: X. Li, M. Stallmann & F. Brglez

Source: NC State University Libraries
Added: August 6, 2018

2004 journal article

On SAT instance classes and a method for reliable performance experiments with SAT solvers

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 43(1-4), 1–34.

By: F. Brglez n, X. Li n & M. Stallmann n

author keywords: satisfiability; conjunctive normal form; equivalence classes; experimental design; exponential and heavy-tail distributions; reliability function
TL;DR: The proposed method not only provides a common platform for a systematic study and a reliable improvement of deterministic and stochastic SAT solvers alike but also supports the introduction and validation of new problem instance classes. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2003 conference paper

Design of experiments in CAD: context and new data sets for ISCAS'99

Proceedings of the 1999 IEEE International Symposium on Circuits and systems, 6, 424–427.

By: F. Brglez n & R. Drechsler*

TL;DR: The background and motivation for the two special sessions at ISCAS'99 are introduced, and a design for archival of data sets and results that are to be readily accessible on the Web is introduced. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2003 conference paper

Equivalence classes of circuit mutants for experimental design

Proceedings of the 1999 IEEE International Symposium on Circuits and systems, 6, 432–435.

By: D. Ghosh n & F. Brglez n

TL;DR: A method to generate tightly controlled equivalence classes of circuit mutants, given the graph-based characterization of a reference netlist, which an general may contain cycles is introduced. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

1999 chapter

Heuristics and experimental design for bigraph crossing number minimization

In Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999. (Vol. 1619, pp. 74–93).

By: M. Stallmann*, F. Brglez* & D. Ghosh*

TL;DR: Two new heuristics that perform well on sparse graphs such as occur in circuit layout problems are presented and outperform existing heuristic on graph classes that range from application-specific to random. (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

1997 journal article

Executable workflows: a paradigm for collaborative design on the Internet

ACM IEEE Design Automation Conference. Proceedings, 34(June 1997), 553–558.

By: H. Lavana n, A. Khetawat n, F. Brglez n & K. Kozminski*

Source: NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.