Sciweavers

1705 search results - page 67 / 341
» Representing Constraints with Automata
Sort
View
IJAR
2008
108views more  IJAR 2008»
13 years 10 months ago
Extending uncertainty formalisms to linear constraints and other complex formalisms
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
Nic Wilson
ICCV
2005
IEEE
15 years 1 hour ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
IAT
2009
IEEE
14 years 4 months ago
Distributed Constraint Optimization for Large Teams of Mobile Sensing Agents
Abstract. A team of mobile sensors can be used for coverage of targets in different environments. The dynamic nature of such an application requires the team of agents to adjust th...
Roie Zivan, Robin Glinton, Katia P. Sycara
OPODIS
2004
13 years 11 months ago
A Constraint-Based Formalism for Consistency in Replicated Systems
Abstract. We present a formalism for modeling replication in a distributed system with concurrent users sharing information. It is based on actions, which represent operations requ...
Marc Shapiro, Karthikeyan Bhargavan, Nishith Krish...
ENTCS
2007
190views more  ENTCS 2007»
13 years 9 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...