Sciweavers

335 search results - page 28 / 67
» Solving the Hamiltonian path problem with a light-based comp...
Sort
View
IPPS
2005
IEEE
15 years 9 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
123
Voted
BROADNETS
2005
IEEE
15 years 9 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
123
Voted
ICRA
2006
IEEE
190views Robotics» more  ICRA 2006»
15 years 9 months ago
An Integrated Approach to Inverse Kinematics and Path Planning for Redundant Manipulators
— We propose a novel solution to the problem of inverse kinematics for redundant robotic manipulators for the purposes of goal selection for path planning. We unify the calculati...
Dominik Bertram, James Kuffner, Rüdiger Dillm...
146
Voted
DOCENG
2006
ACM
15 years 9 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
118
Voted
TAPIA
2003
ACM
15 years 8 months ago
A new infeasible interior-point algorithm for linear programming
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
Miguel Argáez, Leticia Velázquez