Sciweavers

377 search results - page 23 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
EVOW
2005
Springer
14 years 2 months ago
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem
We describe how the standard genotype-phenotype mapping process of Grammatical Evolution (GE) can be enhanced with an attribute grammar to allow GE to operate as a decoder-based Ev...
Robert Cleary, Michael O'Neill
CISIS
2009
IEEE
14 years 3 months ago
Multiple-Paths Search with Concurrent Thread Scheduling for Fast AND/OR Tree Search
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
Fumiyo Takano, Yoshitaka Maekawa, Hironori Kasahar...
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
14 years 5 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
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 9 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
14 years 3 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...