210 search results - page 33 / 42 » Some Competition Programming Problems as the Beginning of Ar... |
89
Voted
CAEPIA
2009
Springer
14 years 10 months ago
2009
Springer
The syntax, semantics and an axiom system for an extension of Propositional Dynamic Logic (PDL) for order of magnitude qualitative reasoning which formalizes the concepts of close...
115
click to vote
AI
2005
Springer
14 years 9 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
AI
2009
Springer
15 years 4 months ago
2009
Springer
This paper shows that a detailed, although non-emotional, description of event or an action can be a reliable source for learning opinions. Empirical results show the practical uti...
ICTAI
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
CP
2005
Springer
15 years 3 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...