Sciweavers

97 search results - page 16 / 20
» Near-Optimal Search in Continuous Domains
Sort
View
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
14 years 1 months ago
Adaptive discretization for probabilistic model building genetic algorithms
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...
Chao-Hong Chen, Wei-Nan Liu, Ying-Ping Chen
APBC
2004
126views Bioinformatics» more  APBC 2004»
13 years 11 months ago
Informative 3D Visualization of Multiple Protein Structures
With the continued growth of three dimensional structural information databases comes a corresponding increase in interest in this data for the study of new sequences and an ever-...
Paulo Lai, Warren Kaplan, W. Bret Church, Raymond ...
CN
2006
78views more  CN 2006»
13 years 9 months ago
A short walk in the Blogistan
The increasingly prominent new subset of Web pages, called `blogs' differs from traditional Web pages both in characteristics and potential to applications. We explore three ...
Edith Cohen, Balachander Krishnamurthy
ICASSP
2011
IEEE
13 years 1 months ago
Relevance language modeling for speech recognition
Language models for speech recognition tend to be brittle across domains, since their performance is vulnerable to changes in the genre or topic of the text on which they are trai...
Kuan-Yu Chen, Berlin Chen
ECAI
2004
Springer
14 years 3 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...