Sciweavers

285 search results - page 56 / 57
» New Ways to Construct Binary Search Trees
Sort
View
AIPS
2008
13 years 7 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
BMCBI
2007
169views more  BMCBI 2007»
13 years 5 months ago
The CRISPRdb database and tools to display CRISPRs and to generate dictionaries of spacers and repeats
Background: In Archeae and Bacteria, the repeated elements called CRISPRs for "clustered regularly interspaced short palindromic repeats" are believed to participate in ...
Ibtissem Grissa, Gilles Vergnaud, Christine Pource...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
13 years 11 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
CSL
2007
Springer
13 years 11 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
13 years 10 months ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...