Sciweavers

597 search results - page 115 / 120
» Dominating Distributions and Learnability
Sort
View
98
Voted
ATAL
2006
Springer
15 years 1 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
CP
2006
Springer
15 years 1 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann
96
Voted
SOFSEM
2000
Springer
15 years 1 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
CODES
2008
IEEE
14 years 11 months ago
Profiling of lossless-compression algorithms for a novel biomedical-implant architecture
In view of a booming market for microelectronic implants, our ongoing research work is focusing on the specification and design of a novel biomedical microprocessor core targeting...
Christos Strydis, Georgi Gaydadjiev
ISSA
2004
14 years 11 months ago
A Unified Architecture For Automatic Software Updates
This paper attempts to address the issue of hardening the internal security of an organisation's network by easing its patch management. Traditionally security has been model...
Dominic White