Sciweavers

1698 search results - page 113 / 340
» Growing Complex Games
Sort
View
RSA
2006
104views more  RSA 2006»
15 years 4 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
RTSS
2003
IEEE
15 years 9 months ago
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes
Real-time systems are growing in complexity and realtime and soft real-time applications are becoming common in general-purpose computing environments. Thus, there is a growing ne...
Scott A. Brandt, Scott A. Banachowski, Caixue Lin,...
SAC
2003
ACM
15 years 9 months ago
Design and Implementation of a Graphical Interface to Xquery
As the use of XML is rapidly growing, a growing number of users without programming skills will need to query XML data. Although designed to be easily understood by humans, XQuery...
Enrico Augurusa, Daniele Braga, Alessandro Campi, ...
UAI
2008
15 years 5 months ago
Sparse Stochastic Finite-State Controllers for POMDPs
Bounded policy iteration is an approach to solving infinitehorizon POMDPs that represents policies as stochastic finitestate controllers and iteratively improves a controller by a...
Eric A. Hansen
126
Voted
DATASCIENCE
2008
79views more  DATASCIENCE 2008»
15 years 4 months ago
Report from the first Workshop on Extremely Large Databases
Industrial and scientific datasets have been growing enormously in size and complexity in recent years. The largest transactional databases and data warehouses can no longer be ho...
Jacek Becla, Kian-Tat Lim