16091 search results - page 418 / 3219 » Solving |
159
click to vote
SAT
2004
Springer
16 years 4 days ago
2004
Springer
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
159
click to vote
SWAT
2004
Springer
16 years 4 days ago
2004
Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
195
click to vote
WLP
2004
Springer
16 years 3 days ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
175
click to vote
CEC
2003
IEEE
16 years 2 days ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
158
click to vote
ICDAR
2003
IEEE
16 years 2 days ago
2003
IEEE
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...