Sciweavers

130 search results - page 3 / 26
» A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
Sort
View
AAAI
2006
13 years 6 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
SAT
2007
Springer
99views Hardware» more  SAT 2007»
13 years 11 months ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...
STACS
2007
Springer
13 years 11 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
ACL
2012
11 years 7 months ago
A Comprehensive Gold Standard for the Enron Organizational Hierarchy
Many researchers have attempted to predict the Enron corporate hierarchy from the data. This work, however, has been hampered by a lack of data. We present a new, large, and freel...
Apoorv Agarwal, Adinoyi Omuya, Aaron Harnly, Owen ...
ASPDAC
2007
ACM
92views Hardware» more  ASPDAC 2007»
13 years 9 months ago
New Block-Based Statistical Timing Analysis Approaches Without Moment Matching
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
Ruiming Chen, Hai Zhou