9842 search results - page 447 / 1969 » The Complexity of the Matching-Cut Problem |
239
click to vote
WSC
2008
15 years 9 months ago
2008
This investigation develops an innovative algorithm for multiple autonomous unmanned aerial vehicle (UAV) mission routing. The concept of a UAV Swarm Routing Problem (SRP) as a ne...
203
Voted
BIS
2008
15 years 9 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
197
Voted
ACID
2006
15 years 8 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
178
click to vote
ICAI
2003
15 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
214
Voted
SIGMETRICS
2010
ACM
15 years 7 months ago
2010
ACM
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...