881 search results - page 58 / 177 » Solving satisfiability problems with preferences |
ECAI
2006
Springer
14 years 12 days ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
IBPRIA
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we argue that maximum expected utility is a suitable framework for modeling a broad range of decision problems arising in pattern recognition and related fields. Exa...
EOR
2010
13 years 8 months ago
2010
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s + M queue, we focus on developing ...
CDC
2009
IEEE
13 years 6 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
CHI
2001
ACM
14 years 9 months ago
2001
ACM
The advent of second-generation intelligent computer tutors raises an important instructional design question: when should tutorial advice be presented in problem solving? This pa...