Sciweavers

176 search results - page 10 / 36
» heuristics 1998
Sort
View
MOC
1998
131views more  MOC 1998»
13 years 7 months ago
An algorithm for evaluation of discrete logarithms in some nonprime finite fields
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
Igor A. Semaev
MP
1998
117views more  MP 1998»
13 years 7 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
WSC
1998
13 years 9 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan
AAAI
1998
13 years 9 months ago
A Feature-Based Learning Method for Theorem Proving
Automatedreasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have manyshortcomings. The...
Matthias Fuchs
AMTA
1998
Springer
13 years 11 months ago
TransEasy: A Chinese-English Machine Translation System Based on Hybrid Approach
This paper describes the progress of a machine translation system from Chinese to English. The system is based on a reusable platform of MT software components. It's a rule-ba...
Qun Liu, Shiwen Yu