Sciweavers

3406 search results - page 418 / 682
» Computational models of classical conditioning
Sort
View
MASCOTS
2008
15 years 8 months ago
Network Information Flow in Network of Queues
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
Phillipa Gill, Zongpeng Li, Anirban Mahanti, Jingx...
RTAS
1997
IEEE
15 years 10 months ago
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control
ÐReal-time middleware services must guarantee predictable performance under specified load and failure conditions, and ensure graceful degradation when these conditions are violat...
Tarek F. Abdelzaher, Ella M. Atkins, Kang G. Shin
CCGRID
2008
IEEE
16 years 1 months ago
Grid Differentiated Services: A Reinforcement Learning Approach
—Large scale production grids are a major case for autonomic computing. Following the classical definition of Kephart, an autonomic computing system should optimize its own beha...
Julien Perez, Cécile Germain-Renaud, Bal&aa...
SIGGRAPH
2010
ACM
15 years 11 months ago
Discrete scale axis representations for 3D geometry
This paper addresses the fundamental problem of computing stable medial representations of 3D shapes. We propose a spatially adaptive classification of geometric features that yi...
Balint Miklos, Joachim Giesen, Mark Pauly
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
16 years 1 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman