Sciweavers

4342 search results - page 57 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
AIPS
2010
13 years 10 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
GECCO
2003
Springer
14 years 28 days ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
BMCBI
2006
139views more  BMCBI 2006»
13 years 7 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
MICRO
2005
IEEE
125views Hardware» more  MICRO 2005»
14 years 1 months ago
Improving Region Selection in Dynamic Optimization Systems
The performance of a dynamic optimization system depends heavily on the code it selects to optimize. Many current systems follow the design of HP Dynamo and select a single interp...
David Hiniker, Kim M. Hazelwood, Michael D. Smith
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 7 months ago
Improving Term Extraction Using Particle Swarm Optimization Techniques
: Problem statement: Term extraction is one of the layers in the ontology development process which has the task to extract all the terms contained in the input document automatica...
Mohammad Syafrullah, Naomie Salim