Sciweavers

4797 search results - page 591 / 960
» The complexity of partition tasks
Sort
View
AAAI
2008
15 years 9 months ago
Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
Magdalena Ortiz, Mantas Simkus, Thomas Eiter
AAAI
2007
15 years 9 months ago
Temporal Difference and Policy Search Methods for Reinforcement Learning: An Empirical Comparison
Reinforcement learning (RL) methods have become popular in recent years because of their ability to solve complex tasks with minimal feedback. Both genetic algorithms (GAs) and te...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
WSC
2007
15 years 9 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
WSC
2008
15 years 9 months ago
Automated generation and parameterization of throughput models for semiconductor tools
Cluster tools play an important role in modern semiconductor fabs. Due to their complexity in configuration and their varying material flow, the creation of accurate throughput mo...
Jan Lange, Kilian Schmidt, Roy Borner, Oliver Rose
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
15 years 8 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan