Sciweavers

942 search results - page 78 / 189
» Cooperating Constraint Solvers
Sort
View
AIPS
1994
14 years 11 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
MIAR
2010
IEEE
14 years 8 months ago
Automatic Computation of Electrodes Trajectory for Deep Brain Stimulation
In this paper, we propose an approach to find the optimal position of an electrode, for assisting surgeons in planning Deep Brain Stimulation. We first show how we formalized the...
Caroline Essert, Claire Haegelen, Pierre Jannin
SIAMJO
2010
128views more  SIAMJO 2010»
14 years 4 months ago
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...
Chengjing Wang, Defeng Sun, Kim-Chuan Toh
AAAI
2012
13 years 6 days ago
Reformulating Temporal Action Logics in Answer Set Programming
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
Joohyung Lee, Ravi Palla
ICASSP
2010
IEEE
14 years 10 months ago
Best-effort cooperative communication without dedicated relays
Traditional decode-and-forward cooperation systems consider dedicated relays, while instead we consider wireless transceivers that cooperatively relay signals in addition to prima...
Nate Goergen, K. J. Ray Liu, T. Charles Clancy