Sciweavers

59 search results - page 5 / 12
» Complexity of determining nonemptiness of the core
Sort
View
MFCS
2009
Springer
14 years 1 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
VISSYM
2004
13 years 8 months ago
Surface Techniques for Vortex Visualization
This paper presents powerful surface based techniques for the analysis of complex flow fields resulting from CFD simulations. Emphasis is put on the examination of vortical struct...
Christoph Garth, Xavier Tricoche, Tobias Salzbrunn...
DAC
2006
ACM
14 years 8 months ago
Scheduling-based test-case generation for verification of multimedia SoCs
Multimedia SoCs are characterized by a main controller that directs the activity of several cores, each of which is in charge of a stage in the processing of a media stream. The v...
Amir Nahir, Avi Ziv, Roy Emek, Tal Keidar, Nir Ron...
SIGECOM
2006
ACM
115views ECommerce» more  SIGECOM 2006»
14 years 29 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
SIGECOM
2005
ACM
153views ECommerce» more  SIGECOM 2005»
14 years 17 days ago
Marginal contribution nets: a compact representation scheme for coalitional games
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
Samuel Ieong, Yoav Shoham