738 search results - page 44 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
IUI
2004
ACM
15 years 3 months ago
2004
ACM
A key to improving at any task is frequent feedback from people whose opinions we care about: our family, friends, mentors, and the experts. However, such input is not usually ava...
ICPP
2002
IEEE
15 years 2 months ago
2002
IEEE
Grid computing systems that have been the focus of much research activities in recent years provide a virtual framework for controlled sharing of resources across institutional bo...
AAMAS
2010
Springer
14 years 10 months ago
2010
Springer
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
AAAI
2010
14 years 7 months ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...