Sciweavers

5595 search results - page 708 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ISPDC
2008
IEEE
16 years 1 months ago
Computing Equilibria in Bimatrix Games by Parallel Support Enumeration
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
Jonathan Widger, Daniel Grosu
SSS
2007
Springer
117views Control Systems» more  SSS 2007»
16 years 29 days ago
Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model
In this paper, we concentrate on distributed algorithms for automated synthesis of fault-tolerant programs in the high atomicity model, where all processes can read and write all p...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abu...
ICMCS
2006
IEEE
136views Multimedia» more  ICMCS 2006»
16 years 27 days ago
Enhanced Semi-Supervised Learning for Automatic Video Annotation
For automatic semantic annotation of large-scale video database, the insufficiency of labeled training samples is a major obstacle. General semi-supervised learning algorithms can...
Meng Wang, Xian-Sheng Hua, Li-Rong Dai, Yan Song
PDP
2005
IEEE
16 years 13 days ago
Distributed Local Resolution of Boolean Equation Systems
Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several seq...
Christophe Joubert, Radu Mateescu
ACMSE
2005
ACM
16 years 12 days ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan