Sciweavers

4242 search results - page 808 / 849
» An Event Spacing Experiment
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 1 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
14 years 1 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
GECCO
2010
Springer
237views Optimization» more  GECCO 2010»
14 years 1 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noiseless BBOB-2010 testbed
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD ....
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
ICSE
2010
IEEE-ACM
14 years 1 months ago
Test generation through programming in UDITA
We present an approach for describing tests using nondeterministic test generation programs. To write such programs, we introduce UDITA, a Java-based language with non-determinist...
Milos Gligoric, Tihomir Gvero, Vilas Jagannath, Sa...
CEC
2009
IEEE
14 years 1 months ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera