Sciweavers

5506 search results - page 736 / 1102
» Minimal Logic Programs
Sort
View
ICALP
2009
Springer
16 years 7 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson
HICSS
2009
IEEE
127views Biometrics» more  HICSS 2009»
16 years 1 months ago
An Optimization Model for Tactical Planning of Wood Procurement
This paper presents a new LP (Linear Programming) model to solve a tactical wood procurement and harvesting problem. This optimization problem occurs in several wood supply chains...
Anders Skjäl, Kaj-Mikael Björk, Jenny &O...
ICASSP
2009
IEEE
16 years 1 months ago
Distributed peer-to-peer beamforming for multiuser relay networks
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
ERSHOV
2009
Springer
16 years 1 months ago
A Complete Invariant Generation Approach for P-solvable Loops
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
Laura Kovács
AINA
2008
IEEE
16 years 1 months ago
A New Service Level Agreement Model for Best-Effort Traffics in IP over WDM
In this paper, we propose a new SLA model for best effort IP traffic over WDM networks. This model jointly considers two QoS metrics, workable traffic volume and availability, as ...
Hung-Yi Chang, Pi-Chung Wang, Chia-Tai Chan, Chun-...