Results 1  10
of
561
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
 IEEE TRANSACTIONS ON COMPUTERS
, 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or costsensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract

Cited by 598 (37 self)
 Add to MetaCart
Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or costsensitive applications. In some situations, designers are not willing to squander computing resources for the sake
Variable Neighborhood Search
, 1997
"... Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications a ..."
Abstract

Cited by 355 (26 self)
 Add to MetaCart
Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications
Descriptive Complexity
, 1999
"... book is dedicated to Daniel and Ellie. Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The book is designed for graduate students or advanced undergraduates in computer science or mathematics and is suitable as a textbook o ..."
Abstract

Cited by 329 (17 self)
 Add to MetaCart
of each other. I would strongly recommend including at least parts of Chapters 9, 10, and 12. Chapters 8 and 13 on lower bounds include some of the nicest combinatorial arguments. Chapter 11 includes a wealth of information on uniformity; to me, the lowlevel nature of translations between problems
Stochastic Geometry and Random Graphs for the Analysis and Design of Wireless Networks
"... Wireless networks are fundamentally limited by the intensity of the received signals and by their interference. Since both of these quantities depend on the spatial location of the nodes, mathematical techniques have been developed in the last decade to provide communicationtheoretic results accoun ..."
Abstract

Cited by 240 (42 self)
 Add to MetaCart
theory, percolation theory, and probabilistic combinatorics – have led to results on the connectivity, the capacity, the outage probability, and other fundamental limits of wireless networks. This tutorial article surveys some of these techniques, discusses their application to model wireless networks
The stages of economic growth.
 Economic History Review , 2nd series 12,
, 1959
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about J ..."
Abstract

Cited by 297 (0 self)
 Add to MetaCart
the balance of production between consumers and capital goods) but which focuses directly and .in some detail on the composition of investment and on developments within particular sectors of the economy. The argument that follows is based on such a flexible, disaggregated theory of production. When
The Combinatorial BLAS: Design, Implementation, and Applications
, 2010
"... This paper presents a scalable highperformance software library to be used for graph analysis and data mining. Large combinatorial graphs appear in many applications of highperformance computing, including computational biology, informatics, analytics, web search, dynamical systems, and sparse mat ..."
Abstract

Cited by 58 (10 self)
 Add to MetaCart
primitives. We describe the Parallel Combinatorial BLAS, which consists of a small but powerful set of linear algebra primitives specifically targeting graph and data mining applications. We provide an extendible library interface and some guiding principles for future development. The library is evaluated
On some extremal problems in graph theory
"... Abstract. In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs – weighing the graph changes a combinatorial problem to one in analysis. We study both weighted and unweighte ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs – weighing the graph changes a combinatorial problem to one in analysis. We study both weighted
ON SOME INTERCONNECTIONS BETWEEN COMBINATORIAL OPTIMIZATION AND EXTREMAL GRAPH THEORY
, 2004
"... The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified type ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified
Combinatorial Nullstellensatz
 COMBINATORICS, PROBABILITY AND COMPUTING
, 1999
"... We present a general algebraic technique and discuss some of its numerous applications in Combinatorial Number Theory, in Graph Theory and in Combinatorics. These applications include results in additive number theory and in the study of graph coloring problems. Many of these are known results, to w ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
We present a general algebraic technique and discuss some of its numerous applications in Combinatorial Number Theory, in Graph Theory and in Combinatorics. These applications include results in additive number theory and in the study of graph coloring problems. Many of these are known results
Combinatorial Design Theory
"... Overview Combinatorial design theory is the study of arranging elements of a finite set into patterns (subsets, words, arrays) according to specified rules. Probably the main object under consideration is a balanced incomplete block design, or BIBD. Specifically, a (v, k, λ)BIBD is a pair (V, B), ..."
Abstract
 Add to MetaCart
these similar contexts. Design theory is a field of combinatorics with close ties to several other areas of mathematics including group theory, the theory of finite fields, the theory of finite geometries, number theory, combinatorial matrix theory, and graph theory, and with a wide range of applications
Results 1  10
of
561