Sciweavers

1003 search results - page 111 / 201
» It's life Jim, but not as we know it!
Sort
View
CORR
2002
Springer
108views Education» more  CORR 2002»
15 years 1 months ago
Vote Elicitation: Complexity and Strategy-Proofness
Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has receive...
Vincent Conitzer, Tuomas Sandholm
TROB
2002
118views more  TROB 2002»
15 years 1 months ago
The odometry error of a mobile robot with a synchronous drive system
This paper presents an error modeling of an odometry system for a synchronous-drive system and a possible strategy for evaluating this error. The odometry error is modeled by intro...
Agostino Martinelli
FAW
2010
Springer
203views Algorithms» more  FAW 2010»
15 years 1 days ago
Online Algorithms for the Newsvendor Problem with and without Censored Demands
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
Peter Sempolinski, Amitabh Chaudhary
INFOCOM
2010
IEEE
14 years 12 months ago
Beyond Triangle Inequality: Sifting Noisy and Outlier Distance Measurements for Localization
—Knowing accurate positions of nodes in wireless ad-hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in ...
Lirong Jian, Zheng Yang, Yunhao Liu
TAMC
2010
Springer
14 years 12 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Pinar Heggernes, Daniel Meister, Udi Rotics