Sciweavers

4036 search results - page 361 / 808
» Formal Methods
Sort
View
IJCNN
2006
IEEE
16 years 23 days ago
Learning to Segment Any Random Vector
— We propose a method that takes observations of a random vector as input, and learns to segment each observation into two disjoint parts. We show how to use the internal coheren...
Aapo Hyvärinen, Jukka Perkiö
LOGCOM
2002
105views more  LOGCOM 2002»
15 years 6 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo
ICRA
2003
IEEE
146views Robotics» more  ICRA 2003»
16 years 1 days ago
Putting the 'I' in 'team': an ego-centric approach to cooperative localization
— This paper describes a cooperative method for relative localization of mobile robot teams; that is, it describes a method whereby every robot in the team can estimate the pose ...
Andrew Howard, Maja J. Mataric, Gaurav S. Sukhatme
CAV
2005
Springer
127views Hardware» more  CAV 2005»
16 years 9 days ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
16 years 1 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...