Sciweavers

1090 search results - page 24 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
ICPP
2009
IEEE
13 years 6 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
ASPDAC
2011
ACM
227views Hardware» more  ASPDAC 2011»
13 years 10 days ago
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
Tae-ho Shin, Hyunok Oh, Soonhoi Ha
CEC
2011
IEEE
12 years 8 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
COCOA
2007
Springer
14 years 2 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
14 years 9 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao