Sciweavers

451 search results - page 76 / 91
» On Parameterized Exponential Time Complexity
Sort
View
ECAI
2006
Springer
14 years 1 months ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings
FLAIRS
2008
14 years 10 days ago
Distributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Yang Xiang, Wanling Zhang
PLANX
2007
13 years 11 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
ISTA
2004
13 years 11 months ago
Combining the Best of Global-as-View and Local-as-View for Data Integration
Currently, there are two main basic approaches to data integration: Global-as-View (GaV) and Local-as-View (LaV). However, both GaV and LaV have their limitations. In a GaV approa...
Li Xu, David W. Embley
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 11 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau