Sciweavers

271 search results - page 24 / 55
» An improved algorithm to accelerate regular expression evalu...
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 4 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 3 months ago
Enhancing differential evolution performance with local search for high dimensional function optimization
In this paper, we proposed Fittest Individual Refinement (FIR), a crossover based local search method for Differential Evolution (DE). The FIR scheme accelerates DE by enhancing...
Nasimul Noman, Hitoshi Iba
AINA
2009
IEEE
15 years 4 months ago
Reliability-Driven Reputation Based Scheduling for Public-Resource Computing Using GA
— For an application in public-resource computing environments, providing reliable scheduling based on resource reliability evaluation is becoming increasingly important. Most ex...
Xiaofeng Wang, Chee Shin Yeo, Rajkumar Buyya, Jins...
ISCAS
2006
IEEE
96views Hardware» more  ISCAS 2006»
15 years 3 months ago
On the initialization of the DNMF algorithm
— A subspace supervised learning algorithm named Discriminant Non-negative Matrix Factorization (DNMF) has been recently proposed for classifying human facial expressions. It dec...
Ioan Buciu, Nikos Nikolaidis, Ioannis Pitas
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
15 years 9 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...