42230 search results - page 12 / 8446 » Algorithms and Complexity Results for |
ATAL
2008
Springer
13 years 8 months ago
2008
Springer
Multi-issue negotiation protocols represent a promising field since most negotiation problems in the real world involve multiple issues. Our work focuses on negotiation with inte...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
SIGECOM
2004
ACM
14 years 23 days ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Human face detection plays an important role in many applications such as video surveillance, face recognition, and face image database management. This paper describes a fast fac...
EOR
2008
13 years 7 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...