Sciweavers

2373 search results - page 342 / 475
» On the Theory of Structural Subtyping
Sort
View
PODC
2010
ACM
15 years 10 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 10 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
SOFSEM
2000
Springer
15 years 10 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
KBSE
1995
IEEE
15 years 10 months ago
A Model for Decision Maintenance in the WinWin Collaboration Framework
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
Prasanta K. Bose
LWA
2008
15 years 7 months ago
Towards the Adaptation of Scientific Course Material powered by Communities of Practice
Several applications support the adaptation of course material. Even though most of these systems allow to specify interaction preferences or even employ user modeling techniques,...
Christine Müller