4930 search results - page 250 / 986 » Learning minimal abstractions |
172
click to vote
SAS
1999
Springer
15 years 11 months ago
1999
Springer
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
162
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we study the buffered clock tree synthesis problem under thermal variations for 3D IC technology. Our major contribution is the Balanced Skew Theorem, which provides...
235
click to vote
AIIDE
2009
15 years 7 months ago
2009
Dynamic scripting is a reinforcement learning algorithm designed specifically to learn appropriate tactics for an agent in a modern computer game, such as Neverwinter Nights. This...
168
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
188
click to vote
IJET
2007
15 years 6 months ago
2007
—Although some critics may argue that conflict resolution cannot be carried out appropriately by virtual education, the basic elements of conflict present themselves within dista...