Sciweavers

742 search results - page 127 / 149
» Classical conditioning
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ICWE
2010
Springer
14 years 2 months ago
AWAIT: Efficient Overload Management for Busy Multi-tier Web Services under Bursty Workloads
:  AWAIT: Efficient Overload Management for Busy Multi-tier Web Services under Bursty Workloads Lei Lu, Ludmila Cherkasova, Vittoria de Nitto Persone, Ningfang Mi, Evgenia Smirn...
Lei Lu, Ludmila Cherkasova, Vittoria de Nitto Pers...
AIPS
2006
13 years 11 months ago
Planning for PDDL3 - An OCSP Based Approach
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
Bharat Ranjan Kavuluri, Naresh Babu Saladi, Deepak...
NIPS
1997
13 years 11 months ago
Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks
A Lyapunov function for excitatory-inhibitory networks is constructed. The construction assumes symmetric interactions within excitatory and inhibitory populations of neurons, and...
H. Sebastian Seung, Tom J. Richardson, J. C. Lagar...
AMC
2010
175views more  AMC 2010»
13 years 10 months ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu