Sciweavers

1002 search results - page 67 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 7 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
EUROGP
2008
Springer
135views Optimization» more  EUROGP 2008»
15 years 4 months ago
Using Genetic Programming for Turing Machine Induction
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
Amashini Naidoo, Nelishia Pillay
134
Voted
ISPASS
2009
IEEE
15 years 9 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 6 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
15 years 8 months ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...