Sciweavers

4934 search results - page 243 / 987
» complexity 2008
Sort
View
JAIR
2007
127views more  JAIR 2007»
15 years 5 months ago
Learning Symbolic Models of Stochastic Domains
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a a new probabilistic planning rule representation to compactly ...
Hanna M. Pasula, Luke S. Zettlemoyer, Leslie Pack ...
149
Voted
TJS
2008
78views more  TJS 2008»
15 years 5 months ago
A performance study of multiprocessor task scheduling algorithms
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
Shiyuan Jin, Guy A. Schiavone, Damla Turgut
144
Voted
TOC
2008
89views more  TOC 2008»
15 years 5 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
136
Voted
CGF
2005
141views more  CGF 2005»
15 years 5 months ago
Survey of Real-Time Rendering Techniques for Crowds
Real-time rendering of photo-realistic humans is considerably outside the scope of current consumer-level computer hardware. There are many techniques, which attempt to bridge the...
G. Ryder, A. M. Day
TSMC
2008
113views more  TSMC 2008»
15 years 5 months ago
Computational Methods for Verification of Stochastic Hybrid Systems
Stochastic hybrid system (SHS) models can be used to analyze and design complex embedded systems that operate in the presence of uncertainty and variability. Verification of reacha...
Xenofon D. Koutsoukos, Derek Riley