1469 search results - page 153 / 294 » Approximate polynomial decomposition |
149
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
124
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
152
click to vote
ICIP
1998
IEEE
16 years 6 months ago
1998
IEEE
In this work, we employ a complex representation for an algebraic curve, and illustrate how the algebraic transformation which relates two Euclidean equivalent curves can be deter...
148
click to vote
LOPSTR
2007
Springer
15 years 11 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
127
Voted
SPIRE
2007
Springer
15 years 11 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...