Sciweavers

675 search results - page 119 / 135
» A parallel search algorithm for CLNS addition optimization
Sort
View
132
Voted
PODC
2006
ACM
15 years 6 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
AI
1998
Springer
15 years 12 days ago
Utility-Based On-Line Exploration for Repeated Navigation in an Embedded Graph
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
Shlomo Argamon-Engelson, Sarit Kraus, Sigalit Sina
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
15 years 6 months ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
PAKDD
2009
ACM
116views Data Mining» more  PAKDD 2009»
15 years 7 months ago
Scalable Web Mining with Newistic
Abstract. Newistic is a web mining platform that collects and analyses documents crawled from the Internet. Although it currently processes news articles, it can be easily adapted ...
Ovidiu Dan, Horatiu Mocian
94
Voted
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
15 years 6 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...