Sciweavers

519 search results - page 65 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
ICC
2009
IEEE
190views Communications» more  ICC 2009»
15 years 8 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
ISCAS
2008
IEEE
106views Hardware» more  ISCAS 2008»
15 years 7 months ago
Hilbert transformers with a piecewise-polynomial-sinusoidal impulse response
— Hilbert transformers are one of the very important special classes of finite impulse response (FIR) filters used in signal processing applications. A method is presented to s...
Raija Lehto, Tapio Saramäki, Olli Vainio
ICSOC
2010
Springer
14 years 11 months ago
Efficient QoS-Aware Service Composition with a Probabilistic Service Selection Policy
Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of ser...
Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden
ASPLOS
2010
ACM
15 years 4 months ago
Butterfly analysis: adapting dataflow analysis to dynamic parallel monitoring
Online program monitoring is an effective technique for detecting bugs and security attacks in running applications. Extending these tools to monitor parallel programs is challeng...
Michelle L. Goodstein, Evangelos Vlachos, Shimin C...
ANOR
2011
117views more  ANOR 2011»
14 years 5 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover