Results 1  10
of
4,484
Automatic predicate abstraction of C programs
 IN PROC. ACM PLDI
, 2001
"... Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, statespace explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems. Recently, there has been significant in ..."
Abstract

Cited by 488 (33 self)
 Add to MetaCart
Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, statespace explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems. Recently, there has been significant
Estimating Attributes: Analysis and Extensions of RELIEF
, 1994
"... . In the context of machine learning from examples this paper deals with the problem of estimating the quality of attributes with and without dependencies among them. Kira and Rendell (1992a,b) developed an algorithm called RELIEF, which was shown to be very efficient in estimating attributes. Origi ..."
Abstract

Cited by 474 (25 self)
 Add to MetaCart
attributes may be unfeasible due to combinatorial explosion. In such cases efficient heuris...
SPADE: An efficient algorithm for mining frequent sequences
 Machine Learning
, 2001
"... Abstract. In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex hash structures which have poor locality. SPADE utilizes combinatorial properties to decompose the original proble ..."
Abstract

Cited by 437 (16 self)
 Add to MetaCart
Abstract. In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex hash structures which have poor locality. SPADE utilizes combinatorial properties to decompose the original
FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO Artificial Intelligence
, 1986
"... Scope and PurposeA summary is provided of some of the recent (and a few notsorecent) developments that otTer promise for enhancing our ability to solve combinatorial optimization problems. These developments may be usefully viewed as a synthesis of the perspectives of operations research and arti ..."
Abstract

Cited by 379 (8 self)
 Add to MetaCart
Scope and PurposeA summary is provided of some of the recent (and a few notsorecent) developments that otTer promise for enhancing our ability to solve combinatorial optimization problems. These developments may be usefully viewed as a synthesis of the perspectives of operations research
PrefixSpan: Mining Sequential Patterns Efficiently by PrefixProjected Pattern Growth
, 2001
"... Sequential pattern mining is an important data mining problem with broad applications. It is challenging since one may need to examine a combinatorially explosive number of possible subsequence patterns. Most of the previously developed sequential pattern mining methods follow the methodology of ..."
Abstract

Cited by 347 (27 self)
 Add to MetaCart
Sequential pattern mining is an important data mining problem with broad applications. It is challenging since one may need to examine a combinatorially explosive number of possible subsequence patterns. Most of the previously developed sequential pattern mining methods follow the methodology
Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
, 1999
"... In combinatorial auctions, multiple goods are sold simultaneously and bidders may bid for arbitrary combinations of goods. Determining the outcome of such an auction is an optimization problem that is NPcomplete in the general case. We propose two methods of overcoming this apparent intractability. ..."
Abstract

Cited by 288 (9 self)
 Add to MetaCart
In combinatorial auctions, multiple goods are sold simultaneously and bidders may bid for arbitrary combinations of goods. Determining the outcome of such an auction is an optimization problem that is NPcomplete in the general case. We propose two methods of overcoming this apparent intractability
Analytic Analysis of Algorithms
, 1992
"... . The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial struct ..."
Abstract

Cited by 331 (13 self)
 Add to MetaCart
are presented. The range of applications includes formal languages, tree enumerations, comparisonbased searching and sorting, digital structures, hashing and occupancy problems. These analytic approaches allow an abstract discussion of asymptotic properties of combinatorial structures and schemas while
Combinatorial approaches to finding subtle signals in DNA sequences,”
 in Proceedings of the 8th International Conference on Intelligient Systems for Molecular Biology,
, 2000
"... Abstract Signal finding (pattern discovery in unaligned DNA sequences) is a fundamental problem in both computer science and molecular biology with important applications in locating regulatory sites and drug target identification. Despite many studies, this problem is far from being resolved: most ..."
Abstract

Cited by 258 (5 self)
 Add to MetaCart
Abstract Signal finding (pattern discovery in unaligned DNA sequences) is a fundamental problem in both computer science and molecular biology with important applications in locating regulatory sites and drug target identification. Despite many studies, this problem is far from being resolved
Combinatorial Geometry
, 1995
"... Abstract. Let P be a set of n points in ~d (where d is a small fixed positive integer), and let F be a collection of subsets of ~d, each of which is defined by a constant number of bounded degree polynomial inequalities. We consider the following Frange searching problem: Given P, build a data stru ..."
Abstract

Cited by 185 (24 self)
 Add to MetaCart
Abstract. Let P be a set of n points in ~d (where d is a small fixed positive integer), and let F be a collection of subsets of ~d, each of which is defined by a constant number of bounded degree polynomial inequalities. We consider the following Frange searching problem: Given P, build a data
Truth revelation in approximately efficient combinatorial auctions
 Journal of the ACM
, 2002
"... Abstract. Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical importance, and in particular of the gold standard ..."
Abstract

Cited by 230 (1 self)
 Add to MetaCart
Abstract. Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical importance, and in particular of the gold standard
Results 1  10
of
4,484