Sciweavers

2834 search results - page 162 / 567
» Representing Trees with Constraints
Sort
View
FLAIRS
2004
14 years 1 days ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
DKE
2007
129views more  DKE 2007»
13 years 10 months ago
First-order temporal pattern mining with regular expression constraints
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting seque...
Sandra de Amo, Daniel A. Furtado
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 9 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...
CIKM
2011
Springer
12 years 10 months ago
Conkar: constraint keyword-based association discovery
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing ne...
Mo Zhou, Yifan Pan, Yuqing Wu
WWW
2009
ACM
14 years 11 months ago
Automated synthesis of composite services with correctness guarantee
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
Ting Deng, Jinpeng Huai, Xianxian Li, Zongxia Du, ...