Sciweavers

914 search results - page 77 / 183
» Analysis of Heuristic Synergies
Sort
View
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 9 days ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
COCOA
2008
Springer
15 years 1 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
CJ
1999
87views more  CJ 1999»
14 years 11 months ago
Evolution-Based Scheduling of Computations and Communications on Distributed Memory Multicomputers
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
Mayez A. Al-Mouhamed
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
15 years 8 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 5 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...