Sciweavers

2056 search results - page 75 / 412
» time 2000
Sort
View
MST
2007
167views more  MST 2007»
14 years 11 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
ICRA
2000
IEEE
120views Robotics» more  ICRA 2000»
15 years 4 months ago
An Algebraic Solution to the Problem of Collision Detection for Rigid Polyhedral Objects
This paper describes a new collision detection algorithm designed for interactive manipulation in virtual environments. Making some assumptions on objects motion, the collision ti...
Stephane Redon, Abderrahmane Kheddar, Sabine Coqui...
NRHM
2000
149views more  NRHM 2000»
14 years 11 months ago
Navigable history: a reader's view of writer's time
Collecting, analyzing, and sharing information via a hypertext results in the continuous modification of information content over a long period of time. Such tasks will benefit fr...
Frank M. Shipman III, Hao-wei Hsieh
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
15 years 3 months ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
LATIN
2000
Springer
15 years 3 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...