3495 search results - page 16 / 699 » On the random satisfiable process |
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
VLSID
2010
IEEE
13 years 8 months ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
FLAIRS
2004
13 years 11 months ago
2004
Intelligent directory assistance is the ability to retrieve relevant subscriber records in the presence of mismatches between the query and the subscriber record. The challenges a...