Sciweavers

3958 search results - page 334 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
15 years 6 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
183
Voted
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
Bidirectional Search for Interactive Motion Synthesis
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
Wan-Yen Lo and Matthias Zwicker
ATAL
2007
Springer
15 years 10 months ago
Workflow coordination for service-oriented multiagent systems
From a multiagent viewpoint, a workflow is a dynamic set of tasks performed by a set of agents to reach a shared goal. We show herein that commitments among agents can be used to ...
Jiangbo Dang, Jingshan Huang, Michael N. Huhns
AICT
2006
IEEE
104views Communications» more  AICT 2006»
16 years 24 days ago
X-domain QoS budget negotiation using Dynamic Programming
Quality of Service (QoS) has been a major concern in the field of network management, even more so for emerging dynamic multimedia applications (Video on Demand, Telefony over IP...
Hélia Pouyllau, Armen Aghasaryan, Laurent C...
185
Voted
INFOCOM
2008
IEEE
16 years 1 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy