Sciweavers

3220 search results - page 586 / 644
» Constrained Graph Processes
Sort
View
AAAI
2007
15 years 8 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
AIPS
2008
15 years 8 months ago
Useless Actions Are Useful
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
WSC
2007
15 years 8 months ago
Enabling smooth and scalable dynamic 3d visualization of discrete-event construction simulations in outdoor augmented reality
Visualization is a powerful method for verifying, validating, and communicating the results of a simulated model. Lack of visual understanding about a simulated model is one of th...
Amir H. Behzadan, Vineet R. Kamat
BIRD
2008
Springer
158views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
A Computational Method for Reconstructing Gapless Metabolic Networks
Abstract. We propose a computational method for reconstructing metabolic networks. The method utilizes optimization techniques and graph traversal algorithms to discover a set of b...
Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko ...
ASPDAC
2005
ACM
78views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Timing driven track routing considering coupling capacitance
Abstract— As VLSI technology enters the ultra-deep submicron era, wire coupling capacitance starts to dominate self capacitance and can no longer be neglected in timing driven ro...
Di Wu, Jiang Hu, Min Zhao, Rabi N. Mahapatra