Sciweavers

9842 search results - page 1479 / 1969
» Problem complexity
Sort
View
KI
2007
Springer
16 years 1 months ago
Pinpointing in the Description Logic EL+
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
Franz Baader, Rafael Peñaloza, Boontawee Su...
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
16 years 1 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...
ICRA
2006
IEEE
190views Robotics» more  ICRA 2006»
16 years 1 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...
ISQED
2006
IEEE
107views Hardware» more  ISQED 2006»
16 years 1 months ago
On Optimizing Scan Testing Power and Routing Cost in Scan Chain Design
— With advanced VLSI manufacturing technology in deep submicron (DSM) regime, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC desi...
Li-Chung Hsu, Hung-Ming Chen
IAT
2005
IEEE
16 years 20 days ago
Dynamic Lightpath Protection in WDM optical Networks Using Ant-based Mobile Agents
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi
« Prev « First page 1479 / 1969 Last » Next »