Sciweavers

8496 search results - page 216 / 1700
» Problem Solving and Complex Systems
Sort
View
DAGSTUHL
2004
15 years 3 months ago
Simplicity Considered Fundamental to Design for Predictability
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
Wolfgang A. Halang
124
Voted
IPPS
2009
IEEE
15 years 9 months ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho
75
Voted
IJHR
2007
42views more  IJHR 2007»
15 years 2 months ago
Nikola Tesla and Robotics
: The paper analyzes some of Tesla's works and his most remarkable views concerning the problem of formulating theoretical bases of automatic control. As a tribute to Tesla�...
Miomir Vukobratovic
FGCS
2000
145views more  FGCS 2000»
15 years 2 months ago
Ant algorithms and stigmergy
Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organiz...
Marco Dorigo, Eric Bonabeau, Guy Theraulaz
AI
2007
Springer
15 years 8 months ago
Planning in Multiagent Expedition with Collaborative Design Networks
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
Yang Xiang, Franklin Hanshar