Sciweavers

942 search results - page 67 / 189
» Distance Constraint Satisfaction Problems
Sort
View
ECAL
2005
Springer
15 years 3 months ago
Evolutionary Transitions as a Metaphor for Evolutionary Optimisation
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert
CORR
2010
Springer
106views Education» more  CORR 2010»
14 years 10 months ago
Symmetry within Solutions
We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping b...
Marijn Heule, Toby Walsh
EJC
2010
14 years 10 months ago
Dualities in full homomorphisms
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
15 years 10 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
14 years 8 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...