Results 1 - 10 of 4,436

Graph-based algorithms for Boolean function manipulation

by Randal E. Bryant - IEEE TRANSACTIONS ON COMPUTERS , 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract - Cited by 3526 (46 self) - Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional

Suffix arrays: A new method for on-line string searches

by Udi Manber, Gene Myers , 1991
"... A new and conceptually simple data structure, called a suffix array, for on-line string searches is intro-duced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract - Cited by 835 (0 self) - Add to MetaCart
in some cases slightly better than) suffix trees. The only drawback is that in those instances where the underlying alphabet is finite and small, suffix trees can be constructed in O(N) time in the worst case, versus O(N log N) time for suffix arrays. However, we give an augmented algorithm that

The Complexity of Decentralized Control of Markov Decision Processes

by Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein - Mathematics of Operations Research , 2000
"... We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalizations of both the fullyobservable case and the partially-observable case that allow for decentralized control are described. ..."
Abstract - Cited by 411 (46 self) - Add to MetaCart
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalizations of both the fullyobservable case and the partially-observable case that allow for decentralized control are described

Complexity of finding embeddings in a k-tree

by Stefan Arnborg, Derek G. Corneil , Andrzej Proskurowski - SIAM JOURNAL OF DISCRETE MATHEMATICS , 1987
"... A k-tree is a graph that can be reduced to the k-complete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a k-tree. This problem is motivated by the existence of polynomial time al ..."
Abstract - Cited by 386 (1 self) - Add to MetaCart
status of two problems related to finding the smallest number k such that a given graph is a partial k-tree. First, the corresponding decision problem is NP-complete. Second, for a fixed (predetermined) value of k, we present an algorithm with polynomially bounded (but exponential in k) worst case time

An Optimal Coarse-grained Arc Consistency Algorithm

by Christian Bessiere, Roland H. C. Yap, Yuanlin Zhang - Artificial Intelligence
"... The use of constraint propagation is the main feature of any constraint solver. It is thus of prime importance to manage the propagation in an efficient and effec-tive fashion. There are two classes of propagation algorithms for general constraints: fine-grained algorithms where the removal of a val ..."
Abstract - Cited by 92 (16 self) - Add to MetaCart
of integration when implementing an algorithm in a constraint solver. How-ever, fine-grained algorithms usually have optimal worst case time complexity while coarse-grained algorithms don’t. For example, AC-3 is an algorithm with non-optimal worst case complexity although it is simple, efficient in practice

Greedy layer-wise training of deep networks

by Yoshua Bengio, Pascal Lamblin, Dan Popovici, Hugo Larochelle , 2006
"... Complexity theory of circuits strongly suggests that deep architectures can be much more efficient (sometimes exponentially) than shallow architectures, in terms of computational elements required to represent some functions. Deep multi-layer neural networks have many levels of non-linearities allow ..."
Abstract - Cited by 394 (48 self) - Add to MetaCart
Complexity theory of circuits strongly suggests that deep architectures can be much more efficient (sometimes exponentially) than shallow architectures, in terms of computational elements required to represent some functions. Deep multi-layer neural networks have many levels of non

Linear multiuser detectors for synchronous code-division multiple-access channels

by Ruxandra Lupas, Sergio Verdú - IEEE TRANS. INFORM. THEORY , 1989
"... In code-division multiple-access systems, simultaneous mul-tiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms enables the receiver to demodulate the data streams of each user, upon observation of the sum of the transmitt ..."
Abstract - Cited by 385 (4 self) - Add to MetaCart
of the transmitted signals, perturbed by additive noise. Under the assumptions of symbol-synchronous transmissions and white Gaussian noise, we analyze the detection mechanism at the receiver, comparing different detectors by their bit error rate in the low background noise region, and by their worst-case behavior

A New Efficient Algorithm for Computing Gröbner Bases (F4)

by Jean-charles Faugère - IN: ISSAC ’02: PROCEEDINGS OF THE 2002 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION , 2002
"... This paper introduces a new efficient algorithm for computing Gröbner bases. To avoid as much as possible intermediate computation, the algorithm computes successive truncated Gröbner bases and it replaces the classical polynomial reduction found in the Buchberger algorithm by the simultaneous reduc ..."
Abstract - Cited by 365 (57 self) - Add to MetaCart
updated and available on a Web page. Even though the new algorithm does not improve the worst case complexity it is several times faster than previous implementations both for integers and modulo computations.

Using Temporal Logics to Express Search Control Knowledge for Planning

by Fahiem Bacchus, Froduald Kabanza - ARTIFICIAL INTELLIGENCE , 1999
"... Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from combinatorial complexity even in simple domains. Theoretical results demonstrate that planning is in the worst case in ..."
Abstract - Cited by 330 (15 self) - Add to MetaCart
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from combinatorial complexity even in simple domains. Theoretical results demonstrate that planning is in the worst case

Tight bounds for worst-case equilibria

by Artur Czumaj, Berthold Vöcking - Proc. 13th SODA , 2002
"... We study the problem of traffic routing in non-cooperative networks. In such networks, users may follow selfish strategies to optimize their own performance measure and therefore their behavior does not have to lead to optimal performance of the entire network. In this paper we investigate the worst ..."
Abstract - Cited by 172 (5 self) - Add to MetaCart
We study the problem of traffic routing in non-cooperative networks. In such networks, users may follow selfish strategies to optimize their own performance measure and therefore their behavior does not have to lead to optimal performance of the entire network. In this paper we investigate
Results 1 - 10 of 4,436