Sciweavers

315 search results - page 59 / 63
» Are Multiple Runs of Genetic Algorithms Better than One
Sort
View
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 10 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
ISPD
2009
ACM
112views Hardware» more  ISPD 2009»
14 years 5 months ago
Post-floorplanning power/ground ring synthesis for multiple-supply-voltage designs
The multiple-supply voltage (MSV) design style has been extensively applied to mitigate dynamic-power consumption. The MSV design paradigm, however, brings many crucial challenges...
Wan-Ping Lee, Diana Marculescu, Yao-Wen Chang
ANTSW
2008
Springer
14 years 23 days ago
Adaptive Particle Swarm Optimization
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perfor...
Zhi-hui Zhan, Jun Zhang
BMCBI
2007
185views more  BMCBI 2007»
13 years 11 months ago
GEDI: a user-friendly toolbox for analysis of large-scale gene expression data
Background: Several mathematical and statistical methods have been proposed in the last few years to analyze microarray data. Most of those methods involve complicated formulas, a...
André Fujita, João Ricardo Sato, Car...
IM
2007
13 years 10 months ago
Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution
This paper describes Armil, a meta-search engine that groups the web snippets returned by auxiliary search engines into disjoint labeled clusters. The cluster labels generated by A...
Filippo Geraci, Marco Pellegrini, Marco Maggini, F...