Sciweavers

3320 search results - page 194 / 664
» Heuristics for the Phylogeny Problem
Sort
View
AAAI
1993
15 years 8 months ago
Model Simplification by Asymptotic Order of Magnitude Reasoning
One of the hardest problems in reasoning about a physical system is finding an approximate model that is mathematically tractable and yet captures the essence of the problem. Appr...
Kenneth Man-kam Yip
JCO
2010
87views more  JCO 2010»
15 years 1 months ago
On-line machine scheduling with batch setups
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
Lele Zhang, Andrew Wirth
WWW
2008
ACM
16 years 7 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
GECCO
2009
Springer
139views Optimization» more  GECCO 2009»
15 years 11 months ago
Meta-heuristics for reconstructing cross cut shredded text documents
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
Matthias Prandtstetter, Günther R. Raidl
AGENTS
2001
Springer
15 years 11 months ago
Terrain coverage with ant robots: a simulation study
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
Sven Koenig, Yaxin Liu