Sciweavers

364 search results - page 59 / 73
» Generalized normal forms and polynomial system solving
Sort
View
ATAL
2006
Springer
15 years 7 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....
GPEM
2010
180views more  GPEM 2010»
15 years 2 months ago
Developments in Cartesian Genetic Programming: self-modifying CGP
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
Simon Harding, Julian F. Miller, Wolfgang Banzhaf
CDC
2008
IEEE
186views Control Systems» more  CDC 2008»
15 years 10 months ago
Continuous-time behavioral portfolio selection
This paper formulates and studies a general continuous-time behavioral portfolio selection model under Kahneman and Tversky's (cumulative) prospect theory, featuring S-shaped...
Hanqing Jin, Xun Yu Zhou
RTSS
1998
IEEE
15 years 8 months ago
Practical Solutions for QoS-Based Resource Allocation
Abstract: The QoS-based Resource Allocation Model (QRAM) proposed in [20] presented an analytical approach for satisfying multiple quality-of-service dimensions in a resource-const...
Ragunathan Rajkumar, Chen Lee, John P. Lehoczky, D...
DAGSTUHL
2007
15 years 5 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois