Sciweavers

807 search results - page 116 / 162
» Competition Adds Complexity
Sort
View
AAMAS
2010
Springer
14 years 10 months ago
Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...
ADT
2010
14 years 10 months ago
An EAP-EHash authentication method adapted to resource constrained terminals
: In the era of mobile and wireless networks, the growing complexity of end devices and the accentuated tendency towards miniaturization of them raise new security challenges. Auth...
Omar Cheikhrouhou, Maryline Laurent, Amin Ben Abda...
CCR
2008
77views more  CCR 2008»
14 years 10 months ago
What would Darwin think about clean-slate architectures?
As significant resources are directed towards clean-slate networking research, it is imperative to understand how cleanslate architectural research compares to the diametrically o...
Constantine Dovrolis
CII
2008
100views more  CII 2008»
14 years 10 months ago
Knowledge formalization in experience feedback processes: An ontology-based approach
Because of the current trend of integration and interoperability of industrial systems, their size and complexity continue to grow making it more difficult to analyze, to understa...
Bernard Kamsu Foguem, Thierry Coudert, C. Bé...
DAM
2008
115views more  DAM 2008»
14 years 9 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey