Sciweavers

3946 search results - page 522 / 790
» The computational complexity of choice sets
Sort
View
174
Voted
NIPS
2007
15 years 8 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
CONCURRENCY
2008
142views more  CONCURRENCY 2008»
15 years 6 months ago
Provenance trails in the Wings/Pegasus system
Our research focuses on creating and executing large-scale scientific workflows that often involve thousands of computations over distributed, shared resources. We describe an app...
Jihie Kim, Ewa Deelman, Yolanda Gil, Gaurang Mehta...
AI
2000
Springer
15 years 6 months ago
On agent-based software engineering
Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly impro...
Nicholas R. Jennings
CG
1999
Springer
15 years 6 months ago
A visibility algorithm for hybrid geometry- and image-based modeling and rendering
Hybrid geometry- and image-based modeling and rendering systems use photographs taken of a real-world environment and mapped onto the surfaces of a 3D model to achieve photorealis...
Thomas A. Funkhouser
ISVD
2010
IEEE
15 years 5 months ago
Alpha Shape Topology of the Cosmic Web
—We study the topology of the Megaparsec Cosmic Web on the basis of the Alpha Shapes of the galaxy distribution. The simplicial complexes of the alpha shapes are used to determin...
Rien van de Weygaert, Erwin Platen, Gert Vegter, B...