685 search results - page 16 / 137 » Closure Operators for Order Structures |
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
116
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
104
click to vote
ENTCS
2008
14 years 11 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
103
click to vote
HEURISTICS
2002
14 years 11 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
105
click to vote
DEON
2010
Springer
15 years 1 months ago
2010
Springer
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...