Sciweavers

3495 search results - page 248 / 699
» On the random satisfiable process
Sort
View
NIPS
2003
15 years 8 months ago
Self-calibrating Probability Forecasting
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
Vladimir Vovk, Glenn Shafer, Ilia Nouretdinov
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 7 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
AHSWN
2008
92views more  AHSWN 2008»
15 years 7 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 7 months ago
On the Capacity of Wireless Multicast Networks
The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information ...
Seyed Reza Mirghaderi, Alireza Bayesteh, Amir K. K...
DAM
2008
111views more  DAM 2008»
15 years 7 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule