Sciweavers

28962 search results - page 5536 / 5793
» Computational Mechanism Design
Sort
View
TAMC
2009
Springer
15 years 11 months ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo
160
Voted
EUROPAR
2001
Springer
15 years 11 months ago
Building TMR-Based Reliable Servers Despite Bounded Input Lifetimes
This paper is on the construction of a server subsystem in a client/server system in an application context where the number of potential clients can be arbitrarily large. The imp...
Paul D. Ezhilchelvan, Jean-Michel Hélary, M...
ICCS
2001
Springer
15 years 11 months ago
Large-Scale Cooperatively-Built KBs
We describe a knowledge server that permits Web users to retrieve and add knowledge in a shared knowledge base. The following features distinguish WebKB-2 from other ontology serve...
Philippe Martin, Peter W. Eklund
197
Voted
ISRR
2001
Springer
165views Robotics» more  ISRR 2001»
15 years 11 months ago
Human-Centered Robotics and Interactive Haptic Simulation
A new field of robotics is emerging. Robots are today moving towards applications beyond the structured environment of a manufacturing plant. They are making their way into the e...
Oussama Khatib, Oliver Brock, K. C. Chang, Diego C...
DCC
2000
IEEE
15 years 11 months ago
Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
Nedeljko Varnica, Michael Fleming, Michelle Effros
« Prev « First page 5536 / 5793 Last » Next »