Sciweavers

976 search results - page 130 / 196
» The Complexity of Timetable Construction Problems
Sort
View
AAAI
2010
13 years 10 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
DATESO
2006
106views Database» more  DATESO 2006»
13 years 10 months ago
GeKon - Applying Novel Approaches to GIS Development
Abstract. This paper describes a few ideas concerned with geographical information systems (GIS) development. Those ideas come from a GIS development project named GeKon, which is ...
Tomas Richta
ESANN
2006
13 years 10 months ago
Classification by means of Evolutionary Response Surfaces
Abstract. Response surfaces are a powerful tool for both classification and regression as they are able to model many different phenomena and construct complex boundaries between c...
Rafael del Castillo Gomariz, Nicolás Garc&i...
IJCAI
2003
13 years 10 months ago
DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks
We present a novel, laser range finder based algorithm for simultaneous localization and mapping (SLAM) for mobile robots. SLAM addresses the problem of constructing an accurate ...
Austin I. Eliazar, Ronald Parr
UAI
2003
13 years 10 months ago
Updating with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
Gert de Cooman, Marco Zaffalon