Sciweavers

2543 search results - page 326 / 509
» Optimal Ordered Problem Solver
Sort
View
NIPS
1997
15 years 2 months ago
Learning to Schedule Straight-Line Code
Program execution speed on modern computers is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execu...
J. Eliot B. Moss, Paul E. Utgoff, John Cavazos, Do...
84
Voted
CORR
2007
Springer
121views Education» more  CORR 2007»
15 years 22 days ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signiï...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...
141
Voted
TEC
2008
165views more  TEC 2008»
15 years 20 days ago
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several app...
Shengxiang Yang, Xin Yao
PE
2000
Springer
93views Optimization» more  PE 2000»
15 years 16 days ago
A novel approach to queue stability analysis of polling models
Previous work in the stability analysis of polling models concentrated mainly on stability of the whole system. This system stability analysis, however, fails to model many real-w...
Rocky K. C. Chang, Sum Lam
107
Voted
IPL
2010
114views more  IPL 2010»
14 years 11 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer