Sciweavers

3367 search results - page 5 / 674
» Incremental assignment problem
Sort
View
75
Voted
ACL
2009
14 years 7 months ago
Incremental Parsing with Monotonic Adjoining Operation
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
Yoshihide Kato, Shigeki Matsubara
ERSA
2004
86views Hardware» more  ERSA 2004»
14 years 11 months ago
Incremental Timing Budget Management in Programmable Systems
Delay budget is an excess delay that each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quali...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
ICC
2007
IEEE
15 years 3 months ago
Transmit Optimization for Relay-Based Cellular OFDMA Systems
Abstract—This paper considers a broadband cellular orthogonal frequency-division multiple-access (OFDMA) system with relay nodes operating in decode-and-forward and half-duplex m...
Wooseok Nam, Woohyuk Chang, Sae-Young Chung, Yong ...
COMCOM
2006
80views more  COMCOM 2006»
14 years 9 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
ORL
2006
114views more  ORL 2006»
14 years 9 months ago
A (1-1/e)-approximation algorithm for the generalized assignment problem
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
Zeev Nutov, Israel Beniaminy, Raphael Yuster