1964 search results - page 381 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
CLEF
2009
Springer
13 years 8 months ago
2009
Springer
This paper presents the participation of the semantic N-levels search engine SENSE at the CLEF 2009 Ad Hoc Robust-WSD Task. During the participation at the same task of CLEF 2008,...
CN
2008
13 years 7 months ago
2008
The primary feature of cognitive radios for wireless communication systems is the capability to optimize the relevant communication parameters given a dynamic wireless channel env...
MOC
1998
13 years 7 months ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...