Sciweavers

1221 search results - page 85 / 245
» Two Consistency Results on Set Mappings
Sort
View
RTSS
1996
IEEE
15 years 10 months ago
Reducing the number of clock variables of timed automata
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...
Conrado Daws, Sergio Yovine
VMV
2001
303views Visualization» more  VMV 2001»
15 years 7 months ago
Extracting Cylinders in Full 3D Data Using a Random Sampling Method and the Gaussian Image
This paper presents a new method for extracting cylinders from an unorganized set of 3D points. The originality of this approach is to separate the extraction problem into two dis...
Thomas Chaperon, François Goulette
IJCAI
1997
15 years 7 months ago
The Origins of Syntax in Visually Grounded Robotic Agents
The paper proposes a set of principles and a general architecture that may explain how language and meaning may originate and complexify in a group of physically grounded distribu...
Luc Steels
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
15 years 11 months ago
New Epistasis Measures for Detecting Independently Optimizable Partitions of Variables
An optimization problem is often represented with a set of variables, and the interaction between the variables is referred to as epistasis. In this paper, we propose two new measu...
Dong-il Seo, Sung-Soon Choi, Byung Ro Moon
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
15 years 10 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin