2137 search results - page 247 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
155
click to vote
DAM
2008
15 years 6 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
170
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
180
click to vote
EPEW
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
201
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
149
click to vote
COMMA
2008
15 years 7 months ago
2008
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...