Sciweavers

1382 search results - page 218 / 277
» Term ordering problem on MDG
Sort
View
AI
2006
Springer
15 years 22 days ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
105
Voted
BMCBI
2006
145views more  BMCBI 2006»
15 years 22 days ago
Querying the public databases for sequences using complex keywords contained in the feature lines
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
Olivier Croce, Michaël Lamarre, Richard Chris...
ENTCS
2007
134views more  ENTCS 2007»
15 years 19 days ago
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
JACM
2000
131views more  JACM 2000»
15 years 14 days ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
107
Voted
COMCOM
1998
102views more  COMCOM 1998»
15 years 11 days ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...