Sciweavers

951 search results - page 174 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
NIPS
1993
14 years 11 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
ATAL
2010
Springer
14 years 11 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
GRC
2008
IEEE
14 years 11 months ago
Effects of Varying the Delay Distribution in Random, Scale-free, and Small-world Networks
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
Bum Soon Jang, Timothy Mann, Yoonsuck Choe
CGF
2008
124views more  CGF 2008»
14 years 10 months ago
Fast Soft Self-Shadowing on Dynamic Height Fields
We present a new, real-time method for rendering soft shadows from large light sources or lighting environments on dynamic height fields. The method first computes a horizon map f...
John Snyder, Derek Nowrouzezahrai
87
Voted
BMCBI
2006
95views more  BMCBI 2006»
14 years 10 months ago
XcisClique: analysis of regulatory bicliques
Background: Modeling of cis-elements or regulatory motifs in promoter (upstream) regions of genes is a challenging computational problem. In this work, set of regulatory motifs si...
Amrita Pati, Cecilia Vasquez-Robinet, Lenwood S. H...