Sciweavers

630 search results - page 125 / 126
» Hardness results for approximating the bandwidth
Sort
View
EOR
2010
88views more  EOR 2010»
13 years 10 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 9 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
SAC
2002
ACM
13 years 9 months ago
A multi-agent system architecture for coordination of just-in-time production and distribution
A multi-agent system architecture for coordination of just-in-time production and distribution is presented. The problem to solve is two-fold: first the right amount of resources ...
Paul Davidsson, Fredrik Wernstedt
SAC
2008
ACM
13 years 9 months ago
Local linear regression with adaptive orthogonal fitting for the wind power application
For short-term forecasting of wind generation, a necessary step is to model the function for the conversion of meteorological variables (mainly wind speed) to power production. Su...
Pierre Pinson, Henrik Aalborg Nielsen, Henrik Mads...