Sciweavers

3406 search results - page 92 / 682
» Computational models of classical conditioning
Sort
View
CCGRID
2008
IEEE
15 years 10 months ago
Admission Control in a Computational Market
We propose, implement and evaluate three admission models for computational Grids. The models take the expected demand into account and offer a specific performance guarantee. Th...
Thomas Sandholm, Kevin Lai, Scott H. Clearwater
TSP
2011
151views more  TSP 2011»
14 years 11 months ago
Stochastic Models for Sparse and Piecewise-Smooth Signals
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
Michael Unser, Pouya Dehghani Tafti
ICML
2009
IEEE
16 years 5 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
NAACL
2007
15 years 5 months ago
Extracting Semantic Orientations of Phrases from Dictionary
We propose a method for extracting semantic orientations of phrases (pairs of an adjective and a noun): positive, negative, or neutral. Given an adjective, the semantic orientatio...
Hiroya Takamura, Takashi Inui, Manabu Okumura
CSJM
2006
59views more  CSJM 2006»
15 years 4 months ago
Traveling Salesman Problem with Transportation
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
Valeriu Ungureanu