Sciweavers

3320 search results - page 234 / 664
» Heuristics for the Phylogeny Problem
Sort
View
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 5 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 8 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ICIP
2009
IEEE
16 years 7 months ago
Seed Image Selection In Interactive Cosegmentation
Interactive image segmentation is a powerful paradigm that allows users to direct the segmentation algorithm towards a desired output. However, marking scribbles on multiple image...
CADE
2002
Springer
16 years 7 months ago
Reasoning by Symmetry and Function Ordering in Finite Model Generation
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
Gilles Audemard, Belaid Benhamou