881 search results - page 83 / 177 » Solving satisfiability problems with preferences |
TASLP
2010
13 years 3 months ago
2010
To solve the knowledge bottleneck problem, active learning has been widely used for its ability to automatically select the most informative unlabeled examples for human annotation...
196
click to vote
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
GLOBECOM
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated...
JAIR
2000
13 years 8 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
TASE
2010
IEEE
13 years 3 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...