14360 search results - page 2811 / 2872 » Time Modeling in MARTE |
147
click to vote
ICONIP
2007
15 years 7 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
167
click to vote
IM
2007
15 years 7 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...
160
click to vote
SIROCCO
2008
15 years 7 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
137
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
183
click to vote
WICON
2008
15 years 7 months ago
2008
Abstract--There has been a great deal of attention on cooperative communication which exploits the spatial diversity among antennas belonging to multiple terminals. Most of the exi...