467 search results - page 51 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
103
click to vote
APAL
2007
14 years 12 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
ESA
2007
Springer
15 years 6 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
102
click to vote
WINE
2005
Springer
15 years 5 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
HYBRID
1998
Springer
15 years 4 months ago
1998
Springer
We discuss properties of high order neurons in competitive learning. In such neurons, geometric shapes replace the role of classic `point' neurons in neural networks. Complex ...