Sciweavers

7853 search results - page 1169 / 1571
» Learning from Each Other
Sort
View
STACS
2007
Springer
16 years 27 days ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
16 years 9 days ago
Promising infeasibility and multiple offspring incorporated to differential evolution for constrained optimization
In this paper, we incorporate a diversity mechanism to the differential evolution algorithm to solve constrained optimization problems without using a penalty function. The aim is...
Efrén Mezura-Montes, Jesús Vel&aacut...
MHCI
2005
Springer
16 years 8 days ago
Three applications for mobile epidemic algorithms
This paper presents a framework for the pervasive sharing of data using wireless networks. ‘FarCry’ uses the mobility of users to carry files between separated networks. Throu...
Paul Tennent, Malcolm Hall, Barry Brown, Matthew C...
WG
2005
Springer
16 years 7 days ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
CCS
2009
ACM
15 years 11 months ago
Multiple password interference in text passwords and click-based graphical passwords
The underlying issues relating to the usability and security of multiple passwords are largely unexplored. However, we know that people generally have difficulty remembering mult...
Sonia Chiasson, Alain Forget, Elizabeth Stobert, P...
« Prev « First page 1169 / 1571 Last » Next »