Sciweavers

1101 search results - page 56 / 221
» heuristics 2007
Sort
View
BMCBI
2004
91views more  BMCBI 2004»
13 years 9 months ago
Improved hit criteria for DNA local alignment
The hit criterion is a key component of heuristic local alignment algorithms. It specifies a class of patterns assumed to witness a potential similarity, and this choice is decisi...
Laurent Noé, Gregory Kucherov
IJCAI
2003
13 years 11 months ago
A Comparison of String Distance Metrics for Name-Matching Tasks
Using an open-source, Java toolkit of name-matching methods, we experimentally compare string distance metrics on the task of matching entity names. We investigate a number of dif...
William W. Cohen, Pradeep D. Ravikumar, Stephen E....
COMCOM
2007
111views more  COMCOM 2007»
13 years 9 months ago
An argument for simple embedded ACL optimisation
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...
Vic Grout, John Davies, John McGinn
NIPS
2003
13 years 11 months ago
Can We Learn to Beat the Best Stock
A novel algorithm for actively trading stocks is presented. While traditional universal algorithms (and technical trading heuristics) attempt to predict winners or trends, our app...
Allan Borodin, Ran El-Yaniv, Vincent Gogan
IJCAI
2001
13 years 11 months ago
Solving Factored MDPs via Non-Homogeneous Partitioning
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
Kee-Eung Kim, Thomas Dean