Sciweavers

315 search results - page 19 / 63
» A General Small Cancellation Theory
Sort
View
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
13 years 11 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
MM
2010
ACM
162views Multimedia» more  MM 2010»
13 years 7 months ago
Interactive visual object search through mutual information maximization
Searching for small objects (e.g., logos) in images is a critical yet challenging problem. It becomes more difficult when target objects differ significantly from the query object...
Jingjing Meng, Junsong Yuan, Yuning Jiang, Nitya N...
SIGECOM
2009
ACM
100views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
The price of uncertainty
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...
Maria-Florina Balcan, Avrim Blum, Yishay Mansour
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 1 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
CSEE
2003
Springer
14 years 23 days ago
The Cross-Course Software Engineering Project at the NTNU: Four Years of Experience
Many software engineering courses include all-term projects to convey principles relating to large-scale multi-person development. But even such projects will easily be too small ...
Guttorm Sindre, Tor Stålhane, Gunnar Brataas...