Sciweavers

2233 search results - page 177 / 447
» On the Complexity of Theory Curbing
Sort
View
ICALP
2007
Springer
16 years 19 days ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
LICS
2006
IEEE
16 years 14 days ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
SIGECOM
2006
ACM
115views ECommerce» more  SIGECOM 2006»
16 years 12 days ago
Multi-attribute coalitional games
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
Samuel Ieong, Yoav Shoham
ICANN
2005
Springer
15 years 12 months ago
A Model for Delay Activity Without Recurrent Excitation
Delay activity (DA) is the increased firing rate of a cortical population, which persists when the stimulus that induced it is removed. It is believed to be the neural substrate f...
Marc de Kamps
ATAL
2005
Springer
15 years 12 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni