Sciweavers

914 search results - page 124 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
CEC
2005
IEEE
14 years 2 months ago
Automated tile design for self-assembly conformations
AbstractSelf-Assembly is a powerful autopoietic mechanism ubiquitous throughout the natural world. It may be found at the molecular scale and also at astronomical scales. Self-asse...
Germán Terrazas, Natalio Krasnogor, Graham ...
INFOCOM
2005
IEEE
14 years 2 months ago
Avoiding transient loops during IGP convergence in IP networks
— When the topology of an IP network changes due to a link failure or a link weight modification, the routing tables of all the routers must be updated. Each of those updates ma...
Pierre Francois, Olivier Bonaventure
KR
1989
Springer
14 years 1 months ago
Situated Control Rules
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Mark Drummond
WSC
2007
13 years 11 months ago
User-friendly scheduling tools for large-scale simulation experiments
Planning and steering numerical experiments that involve many simulations are difficult tasks to automate. We describe how a simulation scheduling tool can help experimenters sub...
Heath A. James, Kenneth A. Hawick, Chris Scogings
TOG
2008
136views more  TOG 2008»
13 years 8 months ago
Adaptive cutaways for comprehensible rendering of polygonal scenes
In 3D renderings of complex scenes, objects of interest may be occluded by those of secondary importance. Cutaway renderings address this problem by omitting portions of secondary...
Michael Burns, Adam Finkelstein