Sciweavers

2233 search results - page 158 / 447
» On the Complexity of Theory Curbing
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 7 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
GPCE
2008
Springer
15 years 7 months ago
Typing communicating component assemblages
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 6 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
CI
2006
94views more  CI 2006»
15 years 6 months ago
Against Optimality: Logical Foundations for Decision-Theoretic Planning in Autonomous Agents
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...
John L. Pollock
ETS
2002
IEEE
116views Hardware» more  ETS 2002»
15 years 6 months ago
Human Activity Systems: A Theoretical Framework for Designing Learning for Multicultural Settings
In the analysis of any learning environment, whether small or large, one observes within it a "set of human activities related to each other so they can be viewed as a whole&...
Jill Slay