Sciweavers

8413 search results - page 126 / 1683
» Ordering Problem Subgoals
Sort
View
CEC
2008
IEEE
14 years 2 months ago
Methods for decreasing the number of objective evaluations for independent computationally expensive objective problems
— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...
Greg Rohling
ICALT
2008
IEEE
14 years 2 months ago
A SOA-Based Framework for Constructing Problem Solving Environments
In this paper we present a framework for constructing problem solving environments for assessing procedural knowledge, i.e. the student’s ability to apply his/her knowledge in o...
Jaime Gálvez, Eduardo Guzmán, Ricard...
COR
1999
99views more  COR 1999»
13 years 7 months ago
Applications of modern heuristic search methods to pattern sequencing problems
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
Andreas Fink, Stefan Voß
RECOMB
2008
Springer
14 years 8 months ago
Internal Validation of Ancestral Gene Order Reconstruction in Angiosperm Phylogeny
Abstract. Whole genome doubling (WGD), a frequent occurrence during the evolution of the angiopsperms, complicates ancestral gene order reconstruction due to the multiplicity of so...
David Sankoff, Chunfang Zheng, P. Kerr Wall, Claud...
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 8 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...