685 search results - page 35 / 137 » Closure Operators for Order Structures |
122
click to vote
AAAI
2004
15 years 3 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
125
click to vote
CIKM
2006
Springer
15 years 5 months ago
2006
Springer
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
119
click to vote
ADAEUROPE
2003
Springer
15 years 7 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
107
click to vote
JLP
2006
15 years 1 months ago
2006
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
105
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In the classical binary genetic algorithm, although crossover within a building block (BB) does not always cause a decrease in fitness, any decrease in fitness results from the ...