Sciweavers

13376 search results - page 48 / 2676
» Problem Solving with
Sort
View
74
Voted
CORR
2007
Springer
95views Education» more  CORR 2007»
15 years 20 days ago
Solving the subset-sum problem with a light-based device
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
Mihai Oltean, Oana Muntean
100
Voted
NETWORKS
2008
15 years 19 days ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
97
Voted
IAJIT
2010
114views more  IAJIT 2010»
14 years 11 months ago
A Quantum-Inspired Differential Evolution Algorithm for Solving the N-Queens Problem
: In this paper, a quantum-inspired differential evolution algorithm for solving the N-queens problem is presented. The N-queens problem aims at placing N queens on an NxN chessboa...
Amer Draa, Souham Meshoul, Hichem Talbi, Mohamed B...
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 3 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
111
Voted
QSHINE
2005
IEEE
15 years 6 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves