Sciweavers

3628 search results - page 92 / 726
» The Decision Diffie-Hellman Problem
Sort
View
JMLR
2010
108views more  JMLR 2010»
13 years 3 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...
MFCS
2007
Springer
14 years 3 months ago
Reachability Problems in Quaternion Matrix and Rotation Semigroups
Abstract. We examine computational problems on quaternion matrix and rotation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is s...
Paul Bell, Igor Potapov
IJFCS
2008
166views more  IJFCS 2008»
13 years 9 months ago
Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
Hsu-Chun Yen
EVOW
2000
Springer
14 years 17 days ago
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
Daniel Merkle, Martin Middendorf
ICTAI
2006
IEEE
14 years 3 months ago
A New Hybrid GA-MDP Algorithm For The Frequency Assignment Problem
We propose a novel algorithm called GA-MDP for solving the frequency assigment problem. GA-MDP inherits the spirit of genetic algorithms with an adaptation of Markov Decision Proc...
Lhassane Idoumghar, René Schott