Sciweavers

2657 search results - page 274 / 532
» On the complexity of hierarchical problem solving
Sort
View
IPL
2008
95views more  IPL 2008»
15 years 6 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
JSAC
2007
109views more  JSAC 2007»
15 years 6 months ago
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...
IWC
2000
81views more  IWC 2000»
15 years 6 months ago
Steps to take before intelligent user interfaces become real
Intelligent user interfaces have been proposed as a means to overcome some of the problems that directmanipulation interfaces cannot handle, such as: information overflow problems...
Kristina Höök
DAM
1999
128views more  DAM 1999»
15 years 6 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
TSP
2011
142views more  TSP 2011»
15 years 1 months ago
Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
Antonio De Maio, Yongwei Huang, Daniel Pére...