Sciweavers

1596 search results - page 146 / 320
» Human-Guided Simple Search
Sort
View
ECAI
2010
Springer
15 years 5 months ago
Strengthening Landmark Heuristics via Hitting Sets
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
Blai Bonet, Malte Helmert
ENTCS
2008
116views more  ENTCS 2008»
15 years 4 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
CN
2006
56views more  CN 2006»
15 years 4 months ago
Maximizing remote work in flooding-based peer-to-peer systems
In peer-to-peer (P2P) systems where individual peers must cooperate to process each other's requests, a useful metric for evaluating the system is how many remote requests ar...
Qixiang Sun, Neil Daswani, Hector Garcia-Molina
EC
2002
228views ECommerce» more  EC 2002»
15 years 4 months ago
Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Gen
Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we pre...
Rajeev Kumar, Peter Rockett
165
Voted
NAR
2007
135views more  NAR 2007»
15 years 4 months ago
g: Profiler - a web-based toolset for functional profiling of gene lists from large-scale experiments
g:Profiler (http://biit.cs.ut.ee/gprofiler/) is a public web server for characterising and manipulating gene lists resulting from mining high-throughput genomic data. g:Profiler h...
Jüri Reimand, Meelis Kull, Hedi Peterson, Jaa...