Results 11  20
of
23,318
Chaff: Engineering an Efficient SAT Solver
, 2001
"... Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well ..."
Abstract

Cited by 1350 (18 self)
 Add to MetaCart
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well
An extensive empirical study of feature selection metrics for text classification
 J. of Machine Learning Research
, 2003
"... Machine learning for text classification is the cornerstone of document categorization, news filtering, document routing, and personalization. In text domains, effective feature selection is essential to make the learning task efficient and more accurate. This paper presents an empirical comparison ..."
Abstract

Cited by 496 (15 self)
 Add to MetaCart
of twelve feature selection methods (e.g. Information Gain) evaluated on a benchmark of 229 text classification problem instances that were gathered from Reuters, TREC, OHSUMED, etc. The results are analyzed from multiple goal perspectives—accuracy, Fmeasure, precision, and recall—since each is appropriate
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
, 1996
"... Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning pr ..."
Abstract

Cited by 579 (33 self)
 Add to MetaCart
problems many times faster than the best current planning systems. Although stochastic methods have been shown to be very e ective on a wide range of scheduling problems, this is the rst demonstration of its power on truly challenging classical planning instances. This work also provides a new perspective
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 855 (68 self)
 Add to MetaCart
into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class
Runtime Mapping of GraphProblem Instances onto Reconfigurable Hardware
 Fuchs, Acta Sci. Math. (Szeged
, 1999
"... this paper we demonstrated a casestudy solution that achieves 6 orders of magnitude speedup over the stateof the art for mapping graphproblem instances onto FPGAs. The novelty of our approach is that the mapping process performs an incremental adaptation of problemspecific configurations to the i ..."
Abstract
 Add to MetaCart
this paper we demonstrated a casestudy solution that achieves 6 orders of magnitude speedup over the stateof the art for mapping graphproblem instances onto FPGAs. The novelty of our approach is that the mapping process performs an incremental adaptation of problemspecific configurations
Configuration requirements from railway interlocking stations (problem instance)
"... Railway interlocks are a domain that provides large and complex configuration tasks. We describe a problem instance that focuses on software configuration, which is a distinguishing feature of the domain. Parameters for the operating system of a railway interlock have to be configured and reconfigu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Railway interlocks are a domain that provides large and complex configuration tasks. We describe a problem instance that focuses on software configuration, which is a distinguishing feature of the domain. Parameters for the operating system of a railway interlock have to be configured and re
Creating Hard Problem Instances In Logic Synthesis Using Exact Minimization
, 1999
"... To evaluate synthesis algorithms, usually benchmark circuits are used. Since for these circuits no exact synthesis results are known, we propose the use of exact minimization to generate hard problem instances. By this we evaluate a standard synthesis tool on different classes of circuits. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
To evaluate synthesis algorithms, usually benchmark circuits are used. Since for these circuits no exact synthesis results are known, we propose the use of exact minimization to generate hard problem instances. By this we evaluate a standard synthesis tool on different classes of circuits.
Distributed Snapshots: Determining Global States of Distributed Systems
 ACM TRANSACTIONS ON COMPUTER SYSTEMS
, 1985
"... This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to s ..."
Abstract

Cited by 1208 (6 self)
 Add to MetaCart
This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps
Learning in graphical models
 STATISTICAL SCIENCE
, 2004
"... Statistical applications in fields such as bioinformatics, information retrieval, speech processing, image processing and communications often involve largescale models in which thousands or millions of random variables are linked in complex ways. Graphical models provide a general methodology for ..."
Abstract

Cited by 806 (10 self)
 Add to MetaCart
for approaching these problems, and indeed many of the models developed by researchers in these applied fields are instances of the general graphical model formalism. We review some of the basic ideas underlying graphical models, including the algorithmic ideas that allow graphical models to be deployed in large
Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution
 Proceedings of the Fifth Conference on Evolutionary Computation in Combinatorial Optimization, volume 3448 of LNCS
, 2005
"... Abstract. We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the LinKernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the LinKernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge
Results 11  20
of
23,318