Sciweavers

1172 search results - page 97 / 235
» Path Algorithms on Regular Graphs
Sort
View
110
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
113
Voted
BMCBI
2007
143views more  BMCBI 2007»
15 years 19 days ago
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
Yair Horesh, Tirza Doniger, Shulamit Michaeli, Ron...
IDEAS
2000
IEEE
117views Database» more  IDEAS 2000»
15 years 4 months ago
Path Query Reduction and Diffusion for Distributed Semi-Structured Data Retrieval
I n this paper, we address the problem of query processing o n distributed semi-structured data. The distributed semistructured data can be modeled as a rooted and edge-labeled gr...
Jaehyung Lee, Yon Dohn Chung, Myoung-Ho Kim
112
Voted
IPMI
2007
Springer
16 years 1 months ago
Inter and Intra-modal Deformable Registration: Continuous Deformations Meet Efficient Optimal Linear Programming
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
Ben Glocker, Nikos Komodakis, Nikos Paragios, Geor...
111
Voted
JUCS
2010
142views more  JUCS 2010»
14 years 11 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima