3049 search results - page 223 / 610 » On the Convergence of Bound Optimization Algorithms |
225
click to vote
MOR
2007
15 years 6 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
150
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
162
click to vote
RTAS
1998
IEEE
15 years 10 months ago
1998
IEEE
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...
188
click to vote
SPIESR
1997
15 years 7 months ago
1997
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
137
click to vote
EMO
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. The optimization and design of two different types of photonic devices - a Fibre Bragg Grating and a Microstructured Polymer Optical Fibre is presented in light of multi...