Sciweavers

1599 search results - page 304 / 320
» Algorithms for Parity Games
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 2 days ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 1 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
103
Voted
ATAL
2006
Springer
15 years 1 months ago
Learning to cooperate in multi-agent social dilemmas
In many Multi-Agent Systems (MAS), agents (even if selfinterested) need to cooperate in order to maximize their own utilities. Most of the multi-agent learning algorithms focus on...
Jose Enrique Munoz de Cote, Alessandro Lazaric, Ma...
AUTOMATICA
1999
122views more  AUTOMATICA 1999»
14 years 9 months ago
Set-valued methods for linear parameter varying systems,
We consider stability analysis and state feedback synthesis for Linear Parameter Varying (LPV) systems. LPV systems are de"ned as linear systems whose dynamics depend on exog...
Jeff S. Shamma, Dapeng Xiong
ACSC
2010
IEEE
14 years 4 months ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche