Sciweavers

1047 search results - page 171 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
EC
2002
228views ECommerce» more  EC 2002»
13 years 8 months ago
Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Gen
Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we pre...
Rajeev Kumar, Peter Rockett
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
12 years 11 months ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
ECAI
2006
Springer
13 years 11 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
14 years 1 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
ECCV
2002
Springer
14 years 10 months ago
Space-Time Tracking
Abstract. We propose a new tracking technique that is able to capture non-rigid motion by exploiting a space-time rank constraint. Most tracking methods use a prior model in order ...
Lorenzo Torresani, Christoph Bregler