Sciweavers

3250 search results - page 62 / 650
» An Algorithm to Solve a Linear Program
Sort
View
IJON
2002
123views more  IJON 2002»
14 years 9 months ago
N-bit parity neural networks: new solutions based on linear programming
In this paper, the N-bit parity problem is solved with a neural network that allows direct connections between the input layer and the output layer. The activation function used i...
Derong Liu, Myron E. Hohil, Stanley H. Smith
ESWS
2011
Springer
14 years 1 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
ICALP
1997
Springer
15 years 1 months ago
Constructive Linear Time Algorithms for Branchwidth
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
Hans L. Bodlaender, Dimitrios M. Thilikos
EOR
2010
110views more  EOR 2010»
14 years 9 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
MP
2008
135views more  MP 2008»
14 years 9 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye