14518 search results - page 232 / 2904 » Two Problems for Sophistication |
102
Voted
ICDAR
2003
IEEE
15 years 6 months 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 ...
77
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
103
click to vote
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
105
Voted
AUSAI
1999
Springer
15 years 5 months ago
1999
Springer
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
101
Voted
ECP
1997
Springer
15 years 5 months ago
1997
Springer
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...