1461 search results - page 157 / 293 » Complexity of Graph Covering Problems |
AMAST
2008
Springer
14 years 3 days ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
ICDE
2001
IEEE
14 years 11 months ago
2001
IEEE
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
PODC
2009
ACM
14 years 10 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
AAAI
2007
14 years 13 days ago
2007
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...
PAMI
2006
13 years 10 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....