Sciweavers

728 search results - page 82 / 146
» Compressing combinatorial objects
Sort
View
82
Voted
STACS
2010
Springer
15 years 7 months ago
Finding Induced Subgraphs via Minimal Triangulations
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
Fedor V. Fomin, Yngve Villanger
88
Voted
IROS
2009
IEEE
149views Robotics» more  IROS 2009»
15 years 7 months ago
Mutual localization in a multi-robot system with anonymous relative position measures
— We address the mutual localization problem for a multi-robot system, under the assumption that each robot is equipped with a sensor that provides a measure of the relative posi...
Antonio Franchi, Giuseppe Oriolo, Paolo Stegagno
PPDP
2009
Springer
15 years 7 months ago
An embedded declarative data transformation language
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
Paul Tarau
99
Voted
SARA
2009
Springer
15 years 7 months ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...
120
Voted
CSCLP
2007
Springer
15 years 6 months ago
Preference-Based Problem Solving for Constraint Programming
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
Ulrich Junker