Sciweavers

610 search results - page 114 / 122
» Using SAT in QBF
Sort
View
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
13 years 9 months ago
Constraint extraction for pseudo-functional scan-based delay testing
Recent research results have shown that the traditional structural testing for delay and crosstalk faults may result in over-testing due to the non-trivial number of such faults t...
Yung-Chieh Lin, Feng Lu, Kai Yang, Kwang-Ting Chen...
AAAI
2010
13 years 9 months ago
Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
Lin Xu, Holger Hoos, Kevin Leyton-Brown
NIPS
2008
13 years 9 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
AAAI
2006
13 years 9 months ago
Sound and Efficient Inference with Probabilistic and Deterministic Dependencies
Reasoning with both probabilistic and deterministic dependencies is important for many real-world problems, and in particular for the emerging field of statistical relational lear...
Hoifung Poon, Pedro Domingos
AIPS
2009
13 years 8 months ago
An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization
Temporally expressive planning, an important class of temporal planning, has attracted much attention lately. Temporally expressive planning is difficult; few existing planners ca...
Ruoyun Huang, Yixin Chen, Weixiong Zhang