Sciweavers

17329 search results - page 84 / 3466
» Improved non-approximability results
Sort
View
PPSN
2010
Springer
13 years 7 months ago
Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
Juan Pedro Castro Gutiérrez, Dario Landa-Si...
WINET
2010
176views more  WINET 2010»
13 years 7 months ago
An improved mechanism for multiple MBMS sessions assignment in B3G cellular networks
In Universal Mobile Telecommunication System (UMTS), the downlink capacity is limited by the base station transmission power. Therefore, power control plays an important role to mi...
Antonios G. Alexiou, Christos Bouras, Vasileios Ko...
ICPR
2010
IEEE
13 years 6 months ago
Improving SIFT-based Descriptors Stability to Rotations
Image descriptors are widely adopted structures to match image features. SIFT-based descriptors are collections of gradient orientation histograms computed on different feature re...
Fabio Bellavia, Domenico Tegolo, Emanuele Trucco
RTAS
2010
IEEE
13 years 6 months ago
Improved Task Management Techniques for Enforcing EDF Scheduling on Recurring Tasks
The management of tasks is an essential requirement in most real-time and embedded systems, but invariably leads to unwanted CPU overheads. This paper is concerned with task manage...
Michael Short
WINE
2010
Springer
178views Economy» more  WINE 2010»
13 years 6 months ago
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
Patrick Briest, Parinya Chalermsook, Sanjeev Khann...