Sciweavers

923 search results - page 63 / 185
» On the Topology of Discrete Strategies
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
ECIS
2000
13 years 9 months ago
Pricing in Network Effect Markets
According to literature, penetration pricing is the dominant pricing strategy for network effect markets. In this paper we show that diffusion of products in a network effect marke...
Oliver Wendt, Falk von Westarp, Wolfgang Köni...
JMLR
2012
11 years 10 months ago
Adaptive MCMC with Bayesian Optimization
This paper proposes a new randomized strategy for adaptive MCMC using Bayesian optimization. This approach applies to nondifferentiable objective functions and trades off explor...
Nimalan Mahendran, Ziyu Wang, Firas Hamze, Nando d...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 8 months ago
Strategical languages of infinite words
: We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory. We first show the existenc...
Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
13 years 10 months ago
Information fusion strategies from distributed filters in packet-drop networks
Abstract-- In this paper we study different distributed estimation schemes for stochastic discrete time linear systems where the communication between the sensors and the estimatio...
Alessandro Chiuso, Luca Schenato